#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int tempM,sumM;
int tempR,sumR;
sumM=0;
sumR=0;
tempM=100000;
tempR=1;
for(int i=0;i<n;i++){
sumM+=tempM;
sumR+=tempR;
tempR*=2;
}
cout<<sumM<<endl;
cout<<sumR<<endl;
return 0;
}
#include <iostream>
using namespace std;
int main(){
int num;
cin>>num;
if(num<100||num>999){
cout<<"-1"<<endl;
return 0;
}
for(int i=1;i<=3;i++){
if(num%10!=0)
{cout<<num%10;}
num/=10;
}
return 0;
}
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
double sinh(double x){
double a=exp(x);
double b=exp(-x);
return (a-b)/2;
}
int main(){
double x;
cin>>x;
double res=sinh(x);
cout<<fixed<<setprecision(5)<<res<<endl;
return 0;
}
#include <iostream>
using namespace std;
int sum(int x) {
int total = 0;
while (x > 0) {
total += x % 10;
x /= 10;
}
return total;
}
int main() {
int num;
cin >> num;
int result = sum(num);
cout << result << endl;
return 0;
}
#include <iostream>
using namespace std;
long long fac(int n) {
if (n == 0 || n == 1) {
return 1;
} else {
return n * fac(n - 1);
}
}
int main() {
int n;
cin >> n;
cout << fac(n) << endl;
return 0;
}
#include <iostream>
#include <cmath>
using namespace std;
bool isprime(int n) {
if (n <= 1)
return false;
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n;
cin >> n;
cout << (isprime(n) ? 1 : 0) << endl;
return 0;
}