#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
int n, used = 0;
const vector<ii> knight = {{2, 1},   {1, 2},   {-1, 2}, {-2, 1},
                           {-2, -1}, {-1, -2}, {1, -2}, {2, -1}};
queue<ii> q;
void fill(int x, int y) {
  ++used;
  printf("%d %d\n", x, y);
}
int main() {
  scanf("%d", &n);
  int m = 2 * n / 3;
  for (int x = 1; x <= m; ++x) {
    fill(300 + x, 300);
    if (x & 1) fill(300 + x, 303);
  }
  for (int i = 0; i < n - used; ++i) {
    fill(300 + m + 1 + i, 300);
  }
}
