#include <bits/stdc++.h>
using namespace std;
int n, m, l, i, j, k, w;
vector<int> c[10001];
int main() {
  cin >> n >> m >> k;
  for (i = 0; i <= n; i++) c[0].push_back(i);
  while (1) {
    l++;
    c[l].push_back(0);
    for (i = 0; i < n / 2; i++) {
      if ((m == c[l - 1][i * 2 + 1] || m == c[l - 1][i * 2 + 2]) &&
          !(k == c[l - 1][i * 2 + 1] || k == c[l - 1][i * 2 + 2]))
        c[l].push_back(m);
      else if (!(m == c[l - 1][i * 2 + 1] || m == c[l - 1][i * 2 + 2]) &&
               (k == c[l - 1][i * 2 + 1] || k == c[l - 1][i * 2 + 2]))
        c[l].push_back(k);
      else if (!(m == c[l - 1][i * 2 + 1] || m == c[l - 1][i * 2 + 2]) &&
               !(k == c[l - 1][i * 2 + 1] || k == c[l - 1][i * 2 + 2]))
        c[l].push_back(c[l - 1][i * 2 + 1]);
      else if ((m == c[l - 1][i * 2 + 1] || m == c[l - 1][i * 2 + 2]) &&
               (k == c[l - 1][i * 2 + 1] || k == c[l - 1][i * 2 + 2])) {
        if (c[l - 1].size() == 3)
          cout << "Final!";
        else
          cout << l;
        exit(0);
      }
    }
    n /= 2;
  }
  return 0;
}
