Problem: Ivan places knights on infinite chessboard. Initially there are n knights. If there is free cell which is under attack of at least 4 knights then he places new knight in this cell. Ivan repeats this until there are no such free cells. One can prove that this process is finite. One can also prove that position in the end does not depend on the order in which new knights are placed.

Ivan asked you to find initial placement of exactly n knights such that in the end there will be at least ⌊ \frac{n^{2}}{10} ⌋ knights.

Input

The only line of input contains one integer n (1 ≤ n ≤ 10^{3}) — number of knights in the initial placement.

Output

Print n lines. Each line should contain 2 numbers x_{i} and y_{i} (-10^{9} ≤ x_{i},    y_{i} ≤ 10^{9}) — coordinates of i-th knight. For all i ≠ j, (x_{i},    y_{i}) ≠ (x_{j},    y_{j}) should hold. In other words, all knights should be in different cells.

It is guaranteed that the solution exists.

Examples

Input

4


Output

1 1
3 1
1 5
4 4


Input

7


Output

2 1
1 2
4 1
5 2
2 6
5 7
6 6

Note

Let's look at second example:

<image>

Green zeroes are initial knights. Cell (3,    3) is under attack of 4 knights in cells (1,    2), (2,    1), (4,    1) and (5,    2), therefore Ivan will place a knight in this cell. Cell (4,    5) is initially attacked by only 3 knights in cells (2,    6), (5,    7) and (6,    6). But new knight in cell (3,    3) also attacks cell (4,    5), now it is attacked by 4 knights and Ivan will place another knight in this cell. There are no more free cells which are attacked by 4 or more knights, so the process stops. There are 9 knights in the end, which is not less than ⌊ \frac{7^{2}}{10} ⌋ = 4.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int i, j, k, q, timer, x, y, n, m, cnt, even, flag, dlfjl, dskgj, dkfj, dskfj,
    boom, r, c, z;
int knights[5005][5005], potentials[5005][5005];
int dirs[8][2] = {{2, -1}, {2, 1},  {1, 2},  {-1, -2},
                  {-2, 1}, {1, -2}, {-1, 2}, {-2, -1}};
set<pair<int, int> > g[5];
vector<pair<int, int> > p;
void update(int x, int y) {
  for (int j = 0; j < 8; j++) {
    int nx = x + dirs[j][0];
    int ny = y + dirs[j][1];
    if (potentials[nx][ny] != 0 && potentials[nx][ny] < 4) {
      g[potentials[nx][ny]].erase(make_pair(nx, ny));
    }
    potentials[nx][ny]++;
    if (potentials[nx][ny] < 4) {
      g[potentials[nx][ny]].insert(make_pair(nx, ny));
    }
    if (potentials[nx][ny] == 4 && knights[nx][ny] == 0) {
      boom++;
      knights[nx][ny] = 1;
      update(nx, ny);
    }
  }
}
int main() {
  cin >> n;
  knights[2500][2500] = 1;
  update(2500, 2500);
  p.push_back(make_pair(2500, 2500));
  int flag = 1;
  boom = 0;
  for (int i = 1; i < n; i++) {
    if (i * i / 10 > boom) cout << i * i / 10 << " " << boom << endl;
    int max1 = 0;
    for (int j = 3; j >= 0; j--) {
      if (!g[j].empty()) {
        auto itr = g[j].begin();
        int cnt = 0;
        int id = -1, optval = -111;
        int nxc, nyc;
        while (itr != g[j].end() && cnt < 33) {
          pair<int, int> v = *itr;
          cnt++;
          itr++;
          for (int k = 0; k < 8; k++) {
            int nx = v.first + dirs[k][0];
            int ny = v.second + dirs[k][1];
            if (knights[nx][ny] == 0) {
              int val = -potentials[nx][ny] * potentials[nx][ny];
              for (int l = 0; l < 8; l++) {
                int nxx = nx + dirs[l][0];
                int nyy = ny + dirs[l][1];
                if (knights[nxx][nyy] == 0) val += potentials[nxx][nyy] + 1;
              }
              if (val > optval) optval = val, nxc = nx, nyc = ny;
            }
          }
        }
        int nx = nxc;
        int ny = nyc;
        boom++;
        knights[nx][ny] = 1;
        update(nx, ny);
        p.push_back(make_pair(nx, ny));
        break;
      }
    }
  }
  for (int i = 0; i < p.size(); i++)
    cout << p[i].first << " " << p[i].second << endl;
  return 0;
}