#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) {
  return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
  if (b == 0LL) return 1LL;
  if (b == 1LL) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1LL) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
const int N = 50;
int mat[N][N];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  int cnt = 0;
  int l = (n + 3) / 3;
  for (int i = 0; i < 3; i++) {
    for (int k = 0; k < l - i; k++) {
      cout << i << " " << i + 2 * k << "\n";
      mat[i][i + 2 * k] = 1;
      cnt++;
    }
  }
  while (cnt < n) {
    cout << ((int)1e8 + cnt) << " " << ((int)1e8 + cnt) << "\n";
    cnt++;
  }
}
