#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  if (a > b) swap(a, b);
  vector<int> v;
  for (int i = 1; i <= n; i++) {
    v.push_back(i);
  }
  int lim = 0;
  int temp = n;
  while (temp) {
    lim++;
    temp /= 2;
  }
  int flag[50000];
  bool ans = false;
  int res = 0;
  vector<int> q;
  for (int i = 1; i < 10; i++) {
    for (int j = 0; j < v.size(); j += 2) {
      int k = j;
      if ((v[k] == a && v[k + 1] == b) || (v[k] == b && v[k + 1] == a)) {
        res = i;
        ans = true;
        break;
      } else if (v[k] == a || v[k + 1] == a) {
        q.push_back(a);
      } else if (v[k] == b || v[k + 1] == b) {
        q.push_back(b);
      } else {
        q.push_back(v[j]);
      }
    }
    if (ans) break;
    v.clear();
    for (int j = 0; j < q.size(); j++) {
      v.push_back(q[j]);
    }
    q.clear();
  }
  if (res == lim - 1)
    cout << "Final!" << endl;
  else
    cout << res << endl;
}
