#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> mp;
vector<long long int> v;
int main() {
  ios_base::sync_with_stdio(0);
  queue<long long int> q;
  long long int n, a, b;
  cin >> n >> a >> b;
  for (long long int i = 1; i <= n; i++) q.push(i);
  long long int cnt = 0;
  long long int winner;
  while (!q.empty()) {
    long long int rta = q.front();
    q.pop();
    long long int rtb = q.front();
    q.pop();
    cnt++;
    if ((rta == a and rtb == b) || (rta == b and rtb == a)) {
      break;
    }
    winner = rta;
    if (rta == a || rta == b) {
      winner = rta;
    }
    if (rtb == a || rtb == b) {
      winner = rtb;
    }
    q.push(winner);
  }
  long long int rt = 0;
  long long int sum = 0;
  for (long long int i = n; i > 0; i = i / 2) {
    rt++;
    n = n / 2;
    sum += n;
    if (cnt <= sum) {
      if (n == 1) {
        cout << "Final!" << endl;
        return 0;
      }
      cout << rt << endl;
      return 0;
    }
  }
  return 0;
}
