Wandering Circus
One of the shamans, when he's not busy building dams, serves as the director of the traveling circus "Romashka". The main attraction of this circus is the performance featuring both Indian and African elephants on the same stage.
The circus has N elephants, conveniently numbered from 1 to N for training purposes. During the act, the elephants come onto the stage in a specific sequence to entertain the audience. For instance, if there are three elephants, the performance might proceed with elephant number one, followed by elephant number three, and then elephant number two.
To keep the audience returning, the director ensures that each show is unique. Two performances are considered different if the elephants appear in a different order. Therefore, each day, the elephants perform in a new sequence that hasn't been seen before. With three elephants, they would perform in various sequences such as:
Each day, the director selects the order of the elephants in a somewhat predictable manner: he starts with the sequence where elephant number one performs first. Among these, he then picks the sequence where elephant number two performs first, and so forth.
The LKSH students attended the circus on the N-th day. They thoroughly enjoyed the show and wanted to share the experience with their friends. However, they forgot which elephant performed first. Can you help them? Write a program to determine which elephant performed first on the N-th day. Keep in mind, the circus may have been running for quite some time.
Input
The first line of the input contains a single number N (1 ≤ N ≤ 10^5).
Output
Output a single number - the number of the elephant that performed first on the N-th day.