#include <bits/stdc++.h>
using namespace std;
int n, a, b, cnt;
vector<int> v;
int main() {
  cin >> n >> a >> b;
  if (a > b) swap(a, b);
  for (int i = 1; i <= n; i++) v.push_back(i);
  while (v.size() != 2) {
    cnt++;
    for (int i = 0; i < v.size(); i += 2) {
      if (v[i] == a && v[i + 1] == b) {
        cout << cnt << endl;
        return 0;
      } else if (v[i] == a || v[i] == b)
        v[i + 1] = 0;
      else
        v[i] = 0;
    }
    for (int i = 0; i < v.size(); i++)
      if (v[i] == 0) {
        for (int j = i; j < v.size() - 1; j++) v[j] = v[j + 1];
        v.pop_back();
        i--;
      }
  }
  cout << "Final!" << endl;
  return 0;
}
