PROGRAMMING:round table

The members of YP ACM training team often discuss the problems they encounter in doing exercises during the summer training. Whenever they are faced with problems that they can't solve, they will sit around a round table for communication. After discussion, there are generally no problems that can't be solved. This is only the round table meeting of YP ACM training team. One day you can come in and experience it, During the discussion one day, JYF came up with a very strange idea. If they exchange seats with two adjacent ACM team members every minute, how long will it take them to get the seat order opposite to the original state（ That is to say, for each team member, the one who was on his left was on his right, and the one who was on his right was on his left). Of course, it's hard for other smart team members to solve this strange problem right away. Do you know how to solve it?
###Input format:
For a given number of n (1 < = n < = 32767), it means that there are n people. How long does it take to get the reverse of the original seat order, that is, for each person, the person who was originally on his left is later on his right, and the person who was originally on his right is on his left.
###Output format:
Output one line for each data, indicating the required time (in minutes)
###Input example:
Here is a set of inputs. For example:
```in
four
five
six
```
###Output example:
The corresponding output is given here. For example:
```out
two
four
six
```







answer：If there is no answer, please comment