#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 7;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int n, a, b;
int tot, res;
int num[] = {1, 2, 4, 8, 16, 32, 64, 128, 256};
int main() {
  cin >> n >> a >> b;
  for (int i = 1;; ++i)
    if (num[i] == n) {
      tot = i;
      break;
    }
  int now = n;
  int cou = 0;
  while (1) {
    n /= 2;
    if ((a <= n && b > n) || (a > n && b <= n)) {
      res = cou;
      break;
    }
    if (a > n && b > n) {
      a -= n;
      b -= n;
    }
    ++cou;
  }
  res = tot - res;
  if (res == tot)
    cout << "Final!" << endl;
  else
    cout << res << endl;
  return 0;
}
