#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long INFLL = 1e18 + 1;
const int MAX = 200001;
const long long MOD = 1000000007;
long long inq(long long k, long long q) {
  if (q == 0) return 1;
  long long l = inq(k, q / 2);
  if (q % 2 == 0)
    return l * l % MOD;
  else
    return (l * l) % MOD * k % MOD;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long cubr(long long a) {
  long long l = -1, r = 1e6 + 2;
  while (l < r - 1) {
    long long mid = (l + r) / 2;
    if (mid * mid * mid > a)
      r = mid;
    else
      l = mid;
  }
  return l;
}
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
long long possible(long long q) {
  if (q == INF) return -1;
  return q;
}
bool correct(int x, int xx) {
  if (x < 0) return 0;
  if (x >= xx) return 0;
  return 1;
}
long long dsumm(long long x, long long k) {
  long long y = 1;
  long long z = 0;
  for (int i = 0; y < 1e18; i++) {
    z += x / y % k;
    y *= k;
  }
  return z;
}
long long dcount(long long x) {
  long long y = 1;
  long long z = 0;
  int c[100];
  for (int i = 0; i < 10; i++) c[i] = 0;
  for (int i = 0; x > 0; i++) {
    if (c[x / y % 10] == 0) z++;
    c[x / y % 10] = 1;
    x /= 10;
  }
  return z;
}
long long lg10(long long x) {
  if (x == 0) return 0;
  return lg10(x / 10) + 1;
}
long long n, m;
vector<int> a;
istream& operator>>(istream& in, vector<int>& v) {
  v.resize(n);
  for (int(i) = 0; (i) != (n); i++) in >> v[i];
  return in;
}
ostream& operator<<(ostream& out, vector<int>& v) {
  for (int(i) = 0; (i) != (n); i++) out << v[i] << " ";
  out << "\n";
  return out;
}
map<int, int> mm;
int main() {
  ios_base::sync_with_stdio();
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  int v1 = 0;
  for (int i = 0; i < n; i++) {
    if (i % 3 == 0) {
      cout << v1 << " 0" << endl;
    }
    if (i % 3 == 1) {
      cout << v1 + 1 << " 0" << endl;
    }
    if (i % 3 == 2) {
      cout << v1 + 1 << " 3" << endl;
      v1 += 2;
    }
  }
}
