#include <bits/stdc++.h>
using namespace std;
queue<int> q;
int main() {
  int n, a, b;
  scanf("%d%d%d", &n, &a, &b);
  if (a > b) swap(a, b);
  int x = n / 2;
  if (a <= x && b > x)
    printf("Final!\n");
  else {
    for (int i = 1; i <= n; i++) q.push(i);
    int ans = 1;
    while (n) {
      int cnt = 0;
      while (cnt < n) {
        int p1 = q.front();
        q.pop();
        int p2 = q.front();
        q.pop();
        if ((p1 == a && p2 == b) || (p1 == b && p2 == a)) {
          cout << ans << endl;
          return 0;
        } else if ((p1 == a) || (p1 == b))
          q.push(p1);
        else
          q.push(p2);
        cnt += 2;
      }
      n /= 2;
      ans++;
    }
    printf("%d\n", ans);
  }
  return 0;
}
