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