The game of Crosses and Crosses is played on the field of 1 × n cells. Two players make moves in turn. Each move the player selects any free cell on the field and puts a cross ‘×’ to it. If after the player’s move there are three crosses in a row, he wins.

You are given n. Find out who wins if both players play optimally.

Input file contains one integer number n (3 ≤ n ≤ 2000).

Output ‘1’ if the first player wins, or ‘2’ if the second player does.