Problem Description

Board games often involve dice (six-sided). Therefore, we would like to present a problem about dice.

Problem: When rolling $ N $ six-sided dice, what is the value that has the highest probability of being the sum of the dice faces? If there are multiple such values, output the smallest one.

Input Format

The input is given from the standard input in the following format:

$ N $

• The first line contains an integer $N\ (1\ ≦\ N\ ≦\ 256)$ representing the number of dice.

Output Format

Output the value that has the highest probability of being the sum of the faces when rolling $ N $ six-sided dice. If there are multiple such values, output the smallest one. End your output with a newline.

Sample Input and Output

Sample Input #1

2

Sample Output #1

7

Sample Input #2

3

Sample Output #2

10

Sample Input #3

1

Sample Output #3

1

Notes/Hints

Sample Explanation 1

When rolling 2 dice, the probabilities of the sums of the dice faces are as follows: - 2 : 1/36 - 3 : 2/36 - 4 : 3/36 - 5 : 4/36 - 6 : 5/36 - 7 : 6/36 - 8 : 5/36 - 9 : 4/36 - 10 : 3/36 - 11 : 2/36 - 12 : 1/36 The value with the highest probability is 7, so output 7.

Sample Explanation 2

There are two values with the highest probability of being the sum, which are 10 and 11. Output the smaller one, which is 10.

见题面 Input 部分

见题面 Output 部分