//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;

int main(){
    
    stringstream ss;
    ss << "0000";
    rep1(i, 100)ss << i;
    string s = ss.str();
    string t = string(s.size(), '0');
    ll N;
    cin >> N;
    rep(n, N){
        ll ca = 0;
        rrep(i, s.size()){
            t[i] += (s[i] - '0' + ca);
            ca = 0;
            if(t[i] > '9'){
                t[i] -= 10;
                ca = 1;
            }
        }
    }
    for(ll i = 0, f = 0; i < t.size(); i++){
        if(i >= 4)f = 1;
        if(t[i] != '0')f = 1;
        if(i == 4)cout << ".";
        if(f)cout << t[i];
    }
    cout << endl;

    return 0;
}