#include <bits/stdc++.h>
using namespace std;
int arr[300], book[300], n, a, b, flag = 0, tun = 0;
int main() {
  cin >> n >> a >> b;
  arr[a] = arr[b] = 2;
  while (!flag) {
    tun++;
    memset(book, 0, sizeof(book));
    for (int i = 1; i <= n; i++) {
      if (!book[i] && (arr[i] == 0 || arr[i] == 2)) {
        for (int j = i + 1; j <= n; j++) {
          if (!book[j] && (arr[j] == 0 || arr[j] == 2)) {
            if (arr[i] == 2 && arr[j] == 2) {
              flag = 1;
            } else if (arr[i] == 0 && arr[j] == 2) {
              arr[i] = 1;
            } else if (arr[i] == 2 && arr[j] == 0)
              arr[j] = 1;
            else
              arr[i] = 1;
            book[i] = book[j] = 1;
            break;
          }
        }
      }
    }
    if (flag) break;
  }
  int ans = (int)pow(2, tun);
  if (ans == n)
    cout << "Final!" << endl;
  else
    cout << tun << endl;
  return 0;
}
