#include <bits/stdc++.h>
using namespace std;
const int MaxN = 2e5 + 10;
const int MAXN = 120 * 1000;
int cD(long long n) { return floor(log10(n) + 1); }
long long a[MaxN];
long long b[MaxN];
long long last = 1000000000007;
long long n, sum = 0, sum1 = 0, sum2 = 0, i, h, j, g, k, ans = 0;
long long d1 = 0, d2 = 0;
long long x, q, l, l1, l2, r, m;
char s[5], t[5];
vector<long long> v;
string s1 = "312831303130313130313031";
string s2 = "312931303130313130313031";
string s3 = s1 + s1 + s2 + s1 + s1;
long long c, c2;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> g >> h;
  g = (g + 1) / 2;
  h = (h + 1) / 2;
  r = 1;
  while (g != h) {
    g = (g + 1) / 2;
    h = (h + 1) / 2;
    r++;
  }
  if (r == log2(n))
    cout << "Final!";
  else
    cout << r;
  return 0;
}
