문제

Author: Tomislav Grbin

Perica was always very good at math. His only weak points were addition and division. To help him with that, his teacher presented him with the following problem. She gave him a 2 by 2 table, containing positive integers A, B, C and D.

We say that the value of a table is equal to:

Perica’s task is to find the minimum number of 90 degrees clockwise rotations required to maximize the value of a given table. Result of a single clockwise rotation is shown below.

입력

The first line of input contains two space separated integers, A and B. The second line of input contains two space separated integers, C and D. All integers are positive and not greater than 100.

출력

The first and only line of output must contain a single integer, minimum number of clockwise rotations required to maximize the table’s value.

예제 입력 1

1 2
3 4

예제 출력 1

2

예제 입력 2

5 9
7 2

예제 출력 2

0

예제 입력 3

41 99
100 13

예제 출력 3

1