Walk Along the Infinite Road

Time limit: 0.1s
Memory limit: 16MB
Input: stdin
Output: stdout

Vasya likes to take a walk in unusual places. One time he stumbled across a beautiful infinite road and, of course, decided to take a walk. Vasya moves along the road with constant speed and passes by several lampposts every hour. It’s notable that exactly at the end of each hour Vasya passed by a lamppost. Let’s call the lampost that Vasya passed by at the end of ii-th hour the ii-th interesting lamppost.

Lampposts are distributed evenly along the road, and each lamppost has a number assigned to it. Numbers of lampposts are successive integers. Vasya wrote down in his notebook all numbers of interesting lampposts without changing his pace.

A gust of wind ripped out a page that had the number of the kk-th interesting lamppost. Vasya wants to find out that number, but he can’t remember his speed on the walk along the infinite road. Help Vasya to restore his notes.

Input data

The first and only line contains one integer kk (0k1050 \leq k \leq 10^5) - end of kk-th hour.

Output data

Output the number of the kk-th interesting lamppost.

Example 1

stdin

2019

stdout

20191027

Example 2

stdin

2020

stdout

20201101

Problem info

ID: 16

Editor: AlexVasiluta

Author:

Source: acm.timus.ru

Tags:

Log in or sign up to be able to send submissions!