#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int N;

vector<pint> nuru;

struct UnionFind // UnionFind Tree (0-indexed)
{
    vector<int> par, rank;
    UnionFind(int N) : par(N), rank(N) { REP(i, N) par[i] = i; }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    void unite(int x, int y) {
        x = find(x), y = find(y); if (x == y) return;
        if (rank[x] < rank[y]) par[x] = y; else par[y] = x;
        if (rank[x] == rank[y]) rank[x]++;
    }
    bool same(int x, int y) { return find(x) == find(y); }
};

void dfs(int dim, int x, int y)
{
    if (x < 0 || y < 0) return;
    nuru.push_back(pint(x, y));
    if (dim)
    {
        dfs(dim - 1, x, y + (1 << dim));
        dfs(dim - 1, x, y - (1 << dim));
        dfs(dim - 1, x - (1 << dim), y);
        dfs(dim - 1, x + (1 << dim), y);
    }
}

UnionFind uf(1);
void Unite(int x, int y, int N)
{
    int n = x * N + y;
    if (y < N - 1) uf.unite(n, n + 1);
    if (y) uf.unite(n, n - 1);
    if (x) uf.unite(n, n - N);
    if (x < N - 1) uf.unite(n, n + N);
}

int main()
{
    cin >> N;
    int d = 1;
    while((1 << d) < N) d++;
    dfs(d, 0, 1);
    
    vector<pint> nuru_new;
    for (auto pa : nuru) if (pa.first >= 0 and pa.second >= 0 and pa.first < N and pa.second < N) nuru_new.push_back(pa);

    nuru = nuru_new;
    nuru_new.clear();

    uf = UnionFind(N * N);
    for (auto pa : nuru) Unite(pa.first, pa.second, N);

    REP(i, N) REP(j, N) if ((i + j) % 2 == 0)
    {
        int n = i * N + j;
        if (!uf.same(n, 0))
        {
            if (j > 0)
            {
                nuru.push_back(pint(i, j - 1));
                Unite(i, j - 1, N);
            }
            else
            {
                nuru.push_back(pint(i - 1, j));
                Unite(i - 1, j, N);
            }
        }
    }

    printf("%d\n", (int)nuru.size());
    for (auto pa : nuru)
    {
        printf("%d %d\n", pa.first, pa.second);
    }
}


Measured memory_bytes: 16620