# coding:utf-8 import sys # from itertools import product # # #ume = [0, 0, 1, 3, 6, 11, 21, 42, 85, 171, 342, 683, 1365, 2730, 5461, 10923, 21846, 43691, 87381, 174762, 349525, # 699051, 1398102, 2796203, 5592405, 10000001] ume_i = [0,22, 23, 24, 24, 24, 25, 25, 25, 25, 25] ume_j = [0,1805703, 3611383, 1222795, 7222771, 13222757, 2445581, 8445561, 14445575, 20445563, 26445559] def popcount(x): return bin(x).count("1") # if N in ume: # print(ume.index(N)) # sys.exit() # else: def solve(): N = int(input()) count = 0 # 100000毎にume # ume_i = [] # ume_j = [] # c = 1000000 if 0<=N<1000000: p = 0 elif 1000000<=N<2000000: p = 1 elif 2000000<=N<3000000: p = 2 elif 3000000<=N<4000000: p = 3 elif 4000000<=N<5000000: p = 4 elif 5000000<=N<6000000: p = 5 elif 6000000<=N<7000000: p = 6 elif 7000000<=N<8000000: p = 7 elif 8000000<=N<9000000: p = 8 elif 9000000<=N<10000000: p = 9 elif 10000000<=N: p = 10 start_i = ume_i[p] start_j = ume_j[p] if p!=0: count = p*1000000-1 x = 0 for i in range(start_i,26): for j in range(start_j,10000000000000): a = bin(j)[2:] if len(a)>i: break if popcount(j)%3==0 and popcount(j)>=3 and a[-1]=='1': count += 1 # ==== # if count == c: # ume_i.append(i) # ume_j.append(j) # c += 1000000 # ==== if count==N: a = '0'*(i-len(a))+a n = a.replace('0', '3').replace('1', '5') x = ''.join(n) x = int(x) print(x) # print(ume_i) # print(ume_j) sys.exit() solve()