#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long N = 1e5 + 36;
const long long M = 3e2 + 36;
const long long INF = 2e9 + 7;
const long long MOD = 998244353;
const long long MOD1 = 1e9 + 7;
const long long MOD2 = 1e9 + 9;
const int XK[4] = {-1, 0, 1, 0};
const int YK[4] = {0, -1, 0, 1};
const int X[8] = {1, 1, -1, -1, 2, 2, -2, -2};
const int Y[8] = {2, -2, 2, -2, 1, -1, 1, -1};
const double long EPS = 1e-12;
vector<pair<int, int> > ans;
int n;
void die() {
  for (auto to : ans) {
    cout << to.first << ' ' << to.second << '\n';
  }
  exit(0);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  if (n == 1) {
    cout << "1 1" << '\n';
    return 0;
  }
  if (n == 2) {
    cout << "1 1" << '\n' << "2 2" << '\n';
    return 0;
  }
  if (n == 3) {
    cout << "1 1" << '\n' << "2 2" << '\n' << "3 3" << '\n';
    return 0;
  }
  for (int i(1); i <= n - 3; i += 4) {
    for (int j(1); j <= n; ++j) {
      ans.push_back({i, j});
      if (int(ans.size()) == n) die();
      if (j % 2 == 0) {
        ans.push_back({i + 3, j});
      }
      if (int(ans.size()) == n) die();
    }
  }
  die();
  return 0;
}
