Codeforces Round #468 B. World Cup

B. World Cup

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

Copy

4 1 2

output

1

input

Copy

8 2 6

output

Final!

input

Copy

8 7 5

output

2

题意：有n支球队，从1-n编号，规定每一轮比赛：排在第一个的和第二个比，排在第三个的和第四个比，以此类推，

例如有8支球队，假设胜出方任意：第一轮 12  34  56  78    第二轮 14  57    第三轮（Final）1 5。

现在给你两个球队编号ab，保证这两个球队每轮必胜，问你这两个球队能否在Final场中见面，是的话输出Final，否则就输出见面的那一场。

思路：直接模拟就可以，每次记得保留ab就好。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,a,b,r,p,f,flag;
ll con[330];
int main()
{
    while(~scanf("%lld%lld%lld",&n,&a,&b))
    {
        r=p=f=flag=0;
        for(ll i=1;i<=n;i++)con[i]=i;
        while(1)
        {
            r++;
            for(ll i=2;i<=n;i+=2)
            {
                if((con[i-1]==a&&con[i]==b)||(con[i-1]==b&&con[i]==a))   //是否同时出现ab对阵
                {
                    flag=1;
                    break;
                }
                else if(con[i-1]==a||con[i]==a)con[++p]=a;   //是否有a
                else if(con[i-1]==b||con[i]==b)con[++p]=b;   //是否有b
                else con[++p]=con[i];     //如果都米有，保留任意一个就可以了
            }
            if(flag==1)break;
            n/=2;
            p=0;
        }
        if(n==2)printf("Final!\n");
        else printf("%lld\n",r);
    }
    return 0;
}