## Mock CCC '22 Contest 1 J1 - Square Root Decomposition

View as PDF

Points: 3
Time limit: 0.25s
Memory limit: 256M

Author:
Problem type

Bob is practicing square root decomposition!

The problem Bob is doing involves breaking a number into groups. It is said to be optimal if is closest to .

He currently has candidates for : integers and . If and are squared, which one is closer to ?

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

#### Input Specification

The first line will contain .

The second line will contain .

The third and final line will contain .

#### Output Specification

On one line, output 1 if is closer to or 2 if is.

#### Sample Input 1

9
3
4

#### Sample Output 1

1

#### Sample Input 2

16
5
3

#### Sample Output 2

2