#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, count = 1, flag = 0;
  cin >> n >> a >> b;
  queue<int> q;
  for (int i = 1; i <= n; i++) q.push(i);
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    int y = q.front();
    q.pop();
    if ((x == a && y == b) || (x == b && y == a)) {
      flag = 1;
      break;
    } else if (y == a || y == b)
      q.push(y);
    else
      q.push(x);
    if (y > q.front()) count++;
  }
  if (q.empty() && flag == 1) {
    cout << "Final!" << endl;
    return 0;
  }
  cout << count << endl;
  return 0;
}
