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


enum N = 10^^6;

void main() {
  alias Pt = Tuple!(long, "x", long, "y");
  Pt[] ps;
  for (long s = 1; ; ++s) {
    foreach (x; 0 .. s + 1) if (gcd(s, x) == 1) {
      ps ~= Pt(x, s - x);
      if (ps.length >= N - 1) {
        goto done;
      }
    }
  }
 done:
  ps.sort!((p, q) => (p.x * q.y > p.y * q.x));
  
  writeln(N);
  {
    long x, y;
    foreach (i; 0 .. N) {
      writeln(x, " ", y);
      if (i < N - 1) {
        x += ps[i].x;
        y += ps[i].y;
      }
    }
  }
}