#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b, c = 0, x, y, z;
  int n, m, f = 0, p[258];
  cin >> n >> x >> y;
  m = n;
  while (m != 1) {
    c++;
    m = m / 2;
  }
  for (int i = 0; i <= n; i++) p[i] = i;
  int cnt = 1;
  for (int i = 0; i < c; i++) {
    for (int j = 0; j <= n; j++) p[j] = p[j] * 2;
    for (int j = 1; j <= n; j++) {
      if (x <= p[j] && x > p[j - 1] && y <= p[j] && y > p[j - 1] && f == 0) {
        f = cnt;
        break;
      }
    }
    cnt++;
  }
  if (c != f)
    cout << f;
  else
    cout << "Final!";
  return 0;
}
