#include <bits/stdc++.h>
int n, t1, t2;
int num = 0;
int dfs(int l, int r) {
  int k = (l + r) / 2;
  num++;
  if (t1 <= k && t2 > k) {
    return num;
  }
  if (t1 <= k && t2 <= k) {
    return dfs(l, k);
  } else {
    return dfs(k, r);
  }
}
int FastLog2(int x) {
  float fx;
  unsigned long ix, exp;
  fx = (float)x;
  ix = *(unsigned long*)&fx;
  exp = (ix >> 23) & 0xFF;
  return exp - 127;
}
int main() {
  int a, b;
  scanf("%d%d%d", &n, &a, &b);
  t1 = std::min(a, b);
  t2 = std::max(a, b);
  int ans = FastLog2(n) + 1 - dfs(1, n);
  if (ans == FastLog2(n))
    puts("Final!");
  else
    printf("%d\n", ans);
  return 0;
}
