#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  map<pair<int, int>, int> grid;
  queue<pair<int, int> > q;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    pair<int, int> x = {!(i % 3) * 3, i / 3 * 2 + (i % 3 > 1)};
    q.push(x);
    grid[x] = 4;
    cnt++;
  }
  while (!q.empty()) {
    int x, y;
    tie(x, y) = q.front();
    q.pop();
    cout << x << ' ' << y << endl;
  }
}
