#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, pool[1000], arr[1000];
  cin >> n >> a >> b;
  for (int i = 1; i <= n; i++) {
    arr[i] = i;
  }
  bool found = false;
  int round = 1;
  int pos, idxPool;
  while (1) {
    pos = 1;
    idxPool = 1;
    while (pos <= n) {
      if ((arr[pos] == a && arr[pos + 1] == b) ||
          (arr[pos] == b && arr[pos + 1] == a)) {
        found = true;
        break;
      } else if (arr[pos] == a || arr[pos + 1] == a) {
        pool[idxPool] = a;
        idxPool++;
      } else if (arr[pos] == b || arr[pos + 1] == b) {
        pool[idxPool] = b;
        idxPool++;
      } else {
        pool[idxPool] = arr[pos];
        idxPool++;
      }
      pos += 2;
    }
    if (found) break;
    if (pos == n) {
      pool[idxPool] = arr[n];
      idxPool++;
    }
    n = idxPool - 1;
    round++;
    for (int i = 1; i <= n; i++) {
      arr[i] = pool[i];
    }
  }
  if (n == 2)
    cout << "Final!" << endl;
  else
    cout << round << endl;
  return 0;
}
