#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5 + 5;
const long long INF = 1e8;
long long N;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
long long ceil(long long A, long long B) { return (A + B - 1) / B; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> N;
  cout << "0 0\n";
  long long horses = 1;
  while (horses < N) {
    for (int i = (0); i < (4); i++) {
      if (horses == N) break;
      cout << dx[i] * ceil(horses, 4LL) << ' ' << dy[i] * ceil(horses, 4LL)
           << '\n';
      horses++;
    }
  }
  return 0;
}
