题干：

The last stage of Football World Cup is played using the play-off system.

There are n teams left in this stage, they are enumerated from 1 to n. Several rounds are held, in each round the remaining teams are sorted in the order of their ids, then the first in this order plays with the second, the third — with the fourth, the fifth — with the sixth, and so on. It is guaranteed that in each round there is even number of teams. The winner of each game advances to the next round, the loser is eliminated from the tournament, there are no draws. In the last round there is the only game with two remaining teams: the round is called the Final, the winner is called the champion, and the tournament is over.

Arkady wants his two favorite teams to play in the Final. Unfortunately, the team ids are already determined, and it may happen that it is impossible for teams to meet in the Final, because they are to meet in some earlier stage, if they are strong enough. Determine, in which round the teams with ids a and b can meet.

Input

The only line contains three integers n, a and b (2 ≤ n ≤ 256, 1 ≤ a, b ≤ n) — the total number of teams, and the ids of the teams that Arkady is interested in.

It is guaranteed that n is such that in each round an even number of team advance, and that a and b are not equal.

Output

In the only line print "Final!" (without quotes), if teams a and b can meet in the Final.

Otherwise, print a single integer — the number of the round in which teams a and b can meet. The round are enumerated from 1.

Examples

Input

4 1 2

Output

1

Input

8 2 6

Output

Final!

Input

8 7 5

Output

2

Note

In the first example teams 1 and 2 meet in the first round.

In the second example teams 2 and 6 can only meet in the third round, which is the Final, if they win all their opponents in earlier rounds.

In the third example the teams with ids 7 and 5 can meet in the second round, if they win their opponents in the first round.

题目大意：

     有2^n支球队（但是输入的不是这里的n，而是相当于n=2^n，即 输入的n一定是2的整数次幂），两两之间对决，输入a，b两支喜欢的球队（他们很强，永远不会输），问两支队会在第几轮相遇，如果到总决赛就输出final，否则输出第几轮。（他们都足够强的情况下）

解题报告：

      以l2^k支球队那里为分界线，看a,b是否是在其两侧，如果在同侧那说明不会在k轮后相遇（即还打不到k轮他俩就相遇了）

   那就k从log2(n)到1模拟就好了。（这里的n就是输入的n）

AC代码：

#include<bits/stdc++.h>using namespace std;int main()
{int n,a,b,t; 	cin>>n>>a>>b;if(a>b) {//a<b t=a;a=b;b=t;}int cll = 1;int cl=n/2;for(cl = 0; cll!=n; cl++) {cll *=2;}cll = cl;while(n>0) {if(a<=(n/2) && b>(n/2)) {cl == cll ? printf("Final!\n") : printf("%d\n",cl) ;return 0 ;}if(b<= n/2) {n/=2;cl--;continue;} else {a-=n/2;b-=n/2;  cl--;n=n/2;continue;}}printf("1\n");return 0 ;
}