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


bool isPrime(int n) {
  if (n <= 1) return false;
  for (int d = 2; d^^2 <= n; ++d) if (n % d == 0) return false;
  return true;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      
      for (int p = N; ; ++p) {
        if (isPrime(p)) {
          auto xs = new int[N];
          auto ys = new int[N];
          foreach (i; 0 .. N) {
            xs[i] = i;
            ys[i] = (i * i) % p;
          }
          
          foreach (i; 0 .. N) {
            writeln(xs[i], " ", ys[i]);
          }
          
          debug {
            bool[long] app;
            foreach (i; 0 .. N) foreach (j; 0 .. N) {
              if (i != j) {
                const key = (xs[j] - xs[i]) * 10L^^9 + (ys[j] - ys[i]);
                assert(key !in app);
                app[key] = true;
              }
            }
          }
          
          break;
        }
      }
    }
  } catch (EOFException e) {
  }
}