#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


constexpr int K = 7;
constexpr char DATA[K][K + 1] = {
"###....",
"###....",
"###....",
"..##...",
"...####",
"...####",
"...####",
};

int main() {
  int N;
  for (; ~scanf("%d", &N); ) {
    vector<int> A(N), B(N);
    for (int u = 0; u < N; ++u) {
      A[u] = 1 + u;
      B[u] = 1000 - u;
    }
    vector<int> X(N, 0), Y(N, 0);
    for (int u = 0; u < N; ++u) for (int v = 0; v < N; ++v) {
      if (u / K == v / K && DATA[u % K][v % K] == '#') {
        chmax(X[v], A[u]);
        chmax(Y[v], B[u]);
      }
    }
    
    for (int u = 0; u < N; ++u) {
      printf("%d %d\n", A[u], B[u]);
    }
    puts("");
    for (int v = 0; v < N; ++v) {
      printf("%d %d\n", X[v], Y[v]);
    }
#ifdef LOCAL
for(int u=0;u<N;++u){
 for(int v=0;v<N;++v)putchar(((A[u]<=X[v]&&B[u]<=Y[v])||(A[u]<=Y[v]&&B[u]<=X[v]))?'#':'.');
 puts("");
}
#endif
  }
  return 0;
}