import std.conv, 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; }

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


immutable L = 31;

int X;

void main() {
  auto binom = new long[][L + 1];
  foreach (i; 0 .. L + 1) {
    binom[i] = new long[i + 1];
    binom[i][0] = binom[i][i] = 1;
    foreach (j; 1 .. i) {
      binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];
    }
  }
  
  try {
    for (; ; ) {
      X = readInt();
      if (0 <= X && X <= L) {
        long ans;
        if (X > 0) {
          ans = binom[L - 1][X - 1] * ((1L << L) - 1);
        }
        writeln(binom[L][X], " ", ans);
      } else {
        writeln(0, " ", 0);
      }
    }
  } catch (EOFException e) {
  }
}