Problem Description

In the ICPC competition, the ranking of two teams is determined by the number of problems solved and the penalty time.

The specific steps to compare the ranking of two teams are as follows:

• First, compare the number of problems solved by the two teams. If they are different, the team with more problems solved ranks higher.
• If the number of problems solved by both teams is the same, compare the penalty times. If they are different, the team with the smaller penalty time ranks higher.
• If both the number of problems solved and the penalty times are the same, the two teams have the same ranking. This scenario is guaranteed not to exist in this problem.

Given the number of problems solved and the penalty times for two teams, you need to determine which team ranks higher.

Input Format

The input consists of two lines.

The first line contains two integers $A_1, P_1$, representing the number of problems solved and the penalty time for the first team, respectively.

The second line contains two integers $A_2, P_2$, representing the number of problems solved and the penalty time for the second team, respectively.

Output Format

Output a single line containing a string.

If the first team ranks higher, output "$\n$" (including the quotes).

If the second team ranks higher, output "$\t$" (including the quotes).

Hint:

The way to output a " is cout << "\"";

The way to output a \ is cout << "\\";

Sample Input and Output

Sample Input #1

2 1000
1 1

Sample Output #1

"\n"

Sample Input #2

3 200
3 100

Sample Output #2

"\t"

Notes

Data Range and Constraints

For $100\%$ of the data, it is guaranteed that $1 \le A_1, A_2 \le 15$ and $1 \le P_1, P_2 \le 5000$.

见题面 Input 部分

见题面 Output 部分