#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define int long long 
#define endl "\n"
const int N = 9e5+10;
int n,m,k;
typedef pair<int,int> PII;
vector<int>g[N];

void solve()
{
    cin>>n;
    n--;
    cout<<n*2<<endl;;
    int x= 1,y = 1;
    for(int i = 0;i < n;i ++)
    {
        if(i%2==0){
            cout<<x<<' '<<y<<endl;
            cout<<x+1<<' '<<y<<endl;
            x+=2,y++;
        }
        else {
            cout<<x<<' '<<y<<endl;
             cout<<x<<' '<<y+1<<endl;
            x++,y+=2;
        }
    }
}
signed  main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
   int t=1;
//   cin>>t;
   while(t--)
   {
       solve();
   }
    return 0;
}