#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const double eps = 1e-9;
int a[maxn];
int tmp[maxn];
int main() {
  int n, aa, b;
  while (~scanf("%d%d%d", &n, &aa, &b)) {
    if (aa > b) swap(aa, b);
    int tt = 1;
    int R = 1;
    for (int i = 1;; i++) {
      tt *= 2;
      if (tt == n) break;
      R++;
    }
    for (int i = 1; i <= n; i++) a[i] = i;
    int cnt = n;
    int now = 0;
    int ans = 1;
    while (1) {
      now = 0;
      int flag = 0;
      for (int i = 1; i <= cnt; i += 2) {
        if (a[i] == aa && a[i + 1] == b) {
          flag = 1;
          break;
        }
        now++;
        if (a[i + 1] == aa || a[i + 1] == b)
          tmp[now] = a[i + 1];
        else
          tmp[now] = a[i];
      }
      if (flag) break;
      for (int i = 1; i <= now; i++) {
        a[i] = tmp[i];
      }
      cnt = now;
      ans++;
    }
    if (ans == R)
      puts("Final!");
    else
      printf("%d\n", ans);
  }
}
