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)); }


Tuple!(BigInt, BigInt) fib(long n) {
  BigInt p = 1, q = 0;
  foreach_reverse (h; 0 .. bsr(n) + 1) {
    // [p, q] -> [p^2 + q^2, 2 p q + q^2]
    const q2 = q * q;
    q = ((q * p) << 1) + q2;
    p = p * p + q2;
    if ((n >> h) & 1) {
      // [p, q] -> [q, p + q]
      p += q;
      swap(p, q);
    }
  }
  return tuple(p, q);
}

void main() {
  try {
    for (; ; ) {
      const L = readLong();
      if (L == 2) {
        writeln("INF");
        writeln("0");
      } else {
        BigInt ans;
        if (L % 2 == 0) {
          const res = fib(L / 2);
          ans = (res[0] * res[1]) << 1;
        } else {
          ans = fib(L)[1];
        }
        writeln(L);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}