Bob is practicing square root decomposition!

The problem Bob is doing involves breaking a number ~N~ into ~B~ groups. It is said to be optimal if ~B~ is closest to ~\sqrt{N}~.

He currently has ~2~ candidates for ~B~: integers ~i~ and ~j~. If ~i~ and ~j~ are squared, which one is closer to ~N~?

The data guarantee that one candidate will be closer than the other.

Constraints

~1 \le N, i, j \le 10^4~

~i \ne j~

Input Specification

The first line will contain ~N~.

The second line will contain ~i~.

The third and final line will contain ~j~.

Output Specification

On one line, output 1 if ~i^2~ is closer to ~N~ or 2 if ~j^2~ is.

Sample Input 1

9
3
4

Sample Output 1

1

Sample Input 2

16
5
3

Sample Output 2

2