from Queue import * # Queue, LifoQueue, PriorityQueue
from bisect import * #bisect, insort
from collections import * #deque, Counter,OrderedDict,defaultdict
#set([]) 
import math
import copy
import itertools
import string
import sys
myread = lambda : map(int,raw_input().split())
def solver():
    D = 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991
    N = int(raw_input())
    D = str(D * N)
    ans = D[:-190] + '.' + D[-190:]
    if ans[0] == '.':
        sys.stdout.write('0')
    print ans
    


if __name__ == "__main__":
    solver()