CF1081A.Definite Game

Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.

He came up with the following game. The player has a positive integer $n$. Initially the value of $n$ equals to $v$ and the player is able to do the following operation as many times as the player want (possibly zero): choose a positive integer $x$ that $x \lt n$ and $x$ is not a divisor of $n$, then subtract $x$ from $n$. The goal of the player is to minimize the value of $n$ in the end.

Soon, Chouti found the game trivial. Can you also beat the game?

Chouti 正在参加一场编程竞赛。然而，在他通过了所有题目之后，他感到无聊，于是决定发明一些小游戏。

他设计了如下游戏：玩家拥有一个正整数 $n$。初始时 $n$ 的值为 $v$，玩家可以执行以下操作任意多次（也可以不执行）：选择一个正整数 $x$，满足 $x \lt n$ 且 $x$ 不是 $n$ 的约数，然后将 $n$ 减去 $x$。玩家的目标是使最终的 $n$ 尽可能小。

很快，Chouti 发现这个游戏非常简单。你也能轻松通关吗？

The input contains only one integer in the first line: $v$ ($1 \le v \le 10^9$), the initial value of $n$.

输入仅在第一行包含一个整数：$v$（$1 \le v \le 10^9$），即 $n$ 的初始值。

Output a single integer, the minimum value of $n$ the player can get.

输出一个整数，即玩家能得到的 $n$ 的最小值。

In the first example, the player can choose $x=3$ in the first turn, then $n$ becomes $5$. He can then choose $x=4$ in the second turn to get $n=1$ as the result. There are other ways to get this minimum. However, for example, he cannot choose $x=2$ in the first turn because $2$ is a divisor of $8$.

In the second example, since $n=1$ initially, the player can do nothing.

在第一个例子中，玩家可以在第一轮选择 $x=3$，此时 $n$ 变为 $5$；接着在第二轮选择 $x=4$，最终得到 $n=1$。还有其他方式可以达到这一最小值。然而，例如，玩家不能在第一轮选择 $x=2$，因为 $2$ 是 $8$ 的一个因数。

在第二个例子中，由于初始时 $n=1$，玩家无法进行任何操作。