import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


BigInt fib(long n) {
  auto a = [BigInt(1), BigInt(0)];
  foreach_reverse (h; 0 .. bsr(n) + 1) {
    a = [a[0]^^2 + a[1]^^2, 2 * a[0] * a[1] + a[1]^^2];
    if ((n >> h) & 1) {
      a = [a[1], a[0] + a[1]];
    }
  }
  return a[1];
}

void main() {
  try {
    for (; ; ) {
      const L = readLong();
      if (L == 2) {
        writeln("INF 0");
      } else {
        BigInt ans = fib(L);
        if (L % 2 == 0) {
          ans -= fib(L / 2)^^2;
        }
        writeln(L, " ", ans);
      }
    }
  } catch (EOFException e) {
  }
}