Colorful Friendship

whoisshihab AUST CSE 44th Batch Pract...
Limits 3s, 512 MB

NN friends are playing a game. N1N-1 of them have seated circling one person. So, there are N1N-1 adjacent pairs of friend, the centered friend and every other N1N-1 friends are adjacent pairs (when N>1N > 1).

In how many minimum colors you can label them. No two adjacent friends can be labeled with the same color.

Input

Input consists of a single integer NN (1N1081 ≤ N ≤ 10^8) denoting the numbers of friends.

Output

Print a single integer XX where XX is the number of colors required to label all of the NN friends.

Sample

InputOutput
3
2

If N = 3 and we have two colors Green and Black, we can color them this way.


Submit

Login to submit.

Statistics

81% Solution Ratio
pathanEarliest, Aug '19
Nazmul81Fastest, 0.0s
gurbuzLightest, 0 B
bokaifShortest, 22B
Toph uses cookies. By continuing you agree to our Cookie Policy.