#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

void f(int n, int x, int c) {
    if (x >= 100) {
        f(n,x-1,(n*x+c)/1000);
        printf("%03d",(n*x+c)%1000);
    }
    else if (x >= 10) {
        f(n,x-1,(n*x+c)/100);
        printf("%02d",(n*x+c)%100);
    }
    else if (x >= 1) {
        f(n,x-1,(n*x+c)/10);
        printf("%01d",(n*x+c)%10);
    }
    else {
        printf("%d.",c);
    }
}

int main(void) {
    int i, n, c;
    cin >> n;
    f(n,100,0);
    puts("");
    return 0;
}