#include <bits/stdc++.h>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define EPS (1e-14)
#define _PA(x,N) rep(i,N){cout<<x[i]<<" ";}cout<<endl;
#define _PA2(x,H,W) rep(i,(H)){rep(j,(W)){cout<<x[i][j]<<" ";}cout<<endl;}

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

int n;
int size;

char base[1005];
char ans[1005];

string s = "0.1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991";


// dst += src
void add(char *dst, char *src) {
	int p = 0, q = 0;
	for (int i = 0; i < size; i++) {
		if (dst[i] == '.') continue;
		int dst_x = dst[i] - '0';
		int src_x = src[i] - '0';
		q = (dst_x + src_x + p) % 10;
		p = (dst_x + src_x + p) / 10;
		dst[i] = '0' + q;

		if (i == size - 1 && p != 0) {
			dst[size] = '0';
			src[size] = '0';
			size++;
		}
	}
}

void solve() {

	size = s.size();
	for (int i = 0; i < size; i++) {
		base[i] = s[size - 1 - i];
		if (base[i] == '.') {
			ans[i] = '.';
		} else {
			ans[i] = '0';
		}
	}

	for (int i = 0; i < n; i++) {
		add(ans, base);
	}

	for (int i = 0; i < size; i++) {
		printf("%c", ans[size - 1 - i]);
	}
	printf("\n");

}

int main() {
	cin >> n;
	solve();
	return 0;
}