#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;

ll fib(int v) {
  ll x = 0;
  ll y = 1;
  REP(i, 0, v) {
    ll z = x + y;
    x = y;
    y = z;
  }
  return x;
}

int main(void){
  int l;
  cin >> l;
  if (l == 2) {
    cout << 3 << endl << "INF" << endl;
    return 0;
  }
  cout << l << endl;
  if (l % 2 == 1) {
    cout << fib(l) << endl;
  } else {
    cout << fib(l) - fib(l / 2) * fib(l / 2) << endl;
  }
}