#include <bits/stdc++.h>
using namespace std;
vector<int> vec;
int n, a, b;
void f(int in, vector<int> cur) {
  vector<int> temp;
  int p, q;
  for (int i = 0; i < cur.size(); i += 2) {
    p = cur[i];
    q = cur[i + 1];
    if (p == a && q == b) {
      if (cur.size() == 2)
        printf("Final!\n");
      else
        printf("%d\n", in);
      exit(0);
    }
    if (p == a || p == b)
      temp.push_back(p);
    else
      temp.push_back(q);
  }
  f(in + 1, temp);
}
int main() {
  cin >> n >> a >> b;
  if (a > b) swap(a, b);
  for (int i = 1; i <= n; i++) {
    vec.push_back(i);
  }
  f(1, vec);
}
