#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  constexpr int n = 1000000;
  vector<P> d;
  [&] {
    for(int k = 1;; k++) {
      for(int i = 0; i <= k; i++) {
        int j = k - i;
        if (gcd(j, i) != 1) continue;
        d.emplace_back(i, j);
        if (d.size() == n - 1) return;
      }
    }
  }();
  sort(all(d), [](const P& a, const P& b) {
    auto [ax, ay] = a;
    auto [bx, by] = b;
    return (ll)ax * by > (ll)ay * bx;
  });
  assert(d.size() == n - 1);
  int sx = 0, sy = 0;
  cout << n << '\n';
  cout << sx << ' ' << sy << '\n';
  for(auto [dx, dy]: d) {
    sx += dx, sy += dy;
    cout << sx << ' ' << sy << '\n';
  }
}