#include <bits/stdc++.h>
using namespace std;
const int oo = 2002;
void solution() {
  int n, y, z, ct = 0;
  cin >> n >> y >> z;
  int f = n / 2;
  vector<int> nw, nz;
  for (long long i = (1); i < (n + 1); i++) nw.push_back(i);
  nz = nw;
  if (y > z) swap(y, z);
  while (++ct and int((nw).size()) > 1) {
    vector<int> sh, sr;
    for (int i = 0; i < int((nw).size()); i += 2) {
      if (nw[i] == y and nw[i + 1] == z) {
        if (log2(n) == ct)
          cout << "Final!";
        else
          cout << ct;
        return;
      } else if ((nw[i + 1] == y || nw[i + 1] == z) and
                 (nw[i] != y || nw[i] != z))
        sh.push_back(nw[i + 1]);
      else
        sh.push_back(nw[i]);
    }
    for (int i = 1; i < int((nz).size()); i += 2) {
      if (nz[i] == y and nz[i - 1] == z) {
        if (log2(n) == ct)
          cout << "Final!";
        else
          cout << ct;
        return;
      } else if ((nz[i - 1] == y || nz[i - 1] == z) and
                 (nz[i] != y || nz[i] != z))
        sr.push_back(nz[i - 1]);
      else
        sr.push_back(nz[i]);
    }
    nw = sh;
    nz = sr;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solution();
  return 0;
}
