friends are playing a game. of them have seated circling one person. So, there are adjacent pairs of friend, the centered friend and every other friends are adjacent pairs (when ).
In how many minimum colors you can label them. No two adjacent friends can be labeled with the same color.
Input consists of a single integer () denoting the numbers of friends.
Print a single integer where is the number of colors required to label all of the friends.
If N = 3 and we have two colors Green and Black, we can color them this way.