import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, 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; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 100;

int X;

void main() {
  // https://oeis.org/A001652
  auto A = new BigInt[LIM];
  A[0] = 0;
  A[1] = 3;
  foreach (n; 2 .. LIM) {
    A[n] = 6 * A[n - 1] - A[n - 2] + 2;
  }
  
  // https://oeis.org/A000129
  auto C = new BigInt[LIM];
  C[0] = 0;
  C[1] = 1;
  foreach (n; 2 .. LIM) {
    C[n] = 2 * C[n - 1] + C[n - 2];
  }
  
  debug {
    foreach (n; 0 .. LIM) {
      writeln(n, " ", A[n], " ", C[n]);
    }
  }
  
  try {
    for (; ; ) {
      X = readInt();
      foreach (n; 1 .. LIM) {
        const a = A[n];
        const b = A[n] + 1;
        const c = C[2 * n + 1];
        if (BigInt(10)^^(X - 1) <= c && c < BigInt(10)^^X) {
          writeln(a, " ", b, " ", c);
          break;
        }
      }
    }
  } catch (EOFException e) {
  }
}