#include <iostream>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#include <queue>
#include <sstream>
#include <ctime>
#include <iterator>
#include <string.h>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <fstream>
#include <assert.h>
#include <numeric>
#include <complex>
#include <random>
#include <utility>



#define IOS ios_base::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a) - 1; i>=(b);i--)
#define rep(i,n) FOR(i,0,n)
#define PB push_back
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define VI vector<int>
#define PII pair<int,int>
#define PLL pair<long long,long long>
#define VL vector<long long >
#define FILL(a, value) memset(a, value, sizeof(a))
const int nax = 2 * (int)1e5 + 147;
 
using namespace std;
 
const int MOD = 998244353;
const int INF = 1e9 +47 ;
const long long LINF = (long long)1e18 + 4747;
 
typedef long long LL;
const double EPS=1e-6;
struct my_matrix {
 
                                    vector<vector<double >> mul(vector<vector<double>> a, vector<vector<double>> b )
                                    {
                                        vector<vector<double>>ans;
                                        ans.resize(SZ(a));
                                        rep(i,SZ(a))ans[i].resize(SZ(b));
                                        rep(i,SZ(a))rep(j,SZ(b))ans[i][j] = 0;
                                      
                                        for(int i=0;i<SZ(a);i++){
                                            for(int j=0;j<SZ(a[i]);j++){
                                                for(int k = 0;k<SZ(b);k++)
                                                    ans[i][k] =(ans[i][k]+(a[i][j]*b[j][k]));
                                            }
                                        }
                                     
                                        return ans;
                                    }
                                    void pow(LL n)
                                    {
                                        vector<vector<double>>res{{50,25}};
                                        vector<vector<double>>a{{0,0.5},{1,0.5}};
                                        while(n > 0 )
                                        {
                                            if(n % 2 == 1)res = mul(res,a);
                                            n/=2;
                                            a =  mul(a,a);
                                        }
                                        cout << fixed << setprecision(10) << res[0][0] << ' ' << 100 - res[0][0] << '\n';
                                    }
                                  }M;
int main() {
    int n;
    cin >> n;
    if(n == 1) cout << 100.0 << ' ' << 0.0 << '\n';
    else if(n == 2) cout << 0.0 << ' ' << 100.0 << '\n';
    else if(n == 3) cout << 50.0 << ' ' << 50.0 << '\n';
    else M.pow(n - 3);
    
    
    
}