Problem: Let us define a magic grid to be a square matrix of integers of size n × n, satisfying the following conditions. 

  * All integers from 0 to (n^2 - 1) inclusive appear in the matrix exactly once. 
  * [Bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all elements in a row or a column must be the same for each row and column. 



You are given an integer n which is a multiple of 4. Construct a magic grid of size n × n.

Input

The only line of input contains an integer n (4 ≤ n ≤ 1000). It is guaranteed that n is a multiple of 4.

Output

Print a magic grid, i.e. n lines, the i-th of which contains n space-separated integers, representing the i-th row of the grid.

If there are multiple answers, print any. We can show that an answer always exists.

Examples

Input


4


Output


8 9 1 13
3 12 7 5
0 2 4 11
6 10 15 14

Input


8


Output


19 55 11 39 32 36 4 52
51 7 35 31 12 48 28 20
43 23 59 15 0 8 16 44
3 47 27 63 24 40 60 56
34 38 6 54 17 53 9 37
14 50 30 22 49 5 33 29
2 10 18 46 41 21 57 13
26 42 62 58 1 45 25 61

Note

In the first example, XOR of each row and each column is 13.

In the second example, XOR of each row and each column is 60.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void printprecise(double l, long long int precision) {
  std::cout << std::fixed;
  std::cout << std::setprecision(precision);
  std::cout << l;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void initialize(long long int ar[], long long int n) {
  for (long long int x = 0; x < n; x++) ar[x] = x;
}
void printarray(long long int ar[], long long int n) {
  for (long long int x = 0; x < n; x++) cout << ar[x] << " ";
  cout << endl;
}
void printvector(vector<long long int> v) {
  for (long long int x = 0; x < v.size(); x++) {
    cout << v[x] << " ";
  }
  cout << endl;
}
long long int root(long long int i, long long int ar[]) {
  while (ar[i] != i) {
    ar[i] = ar[ar[i]];
    i = ar[i];
  }
  return i;
}
void unione(long long int a, long long int b, long long int ar[]) {
  long long int p = root(a, ar);
  long long int q = root(b, ar);
  ar[p] = ar[q];
}
void bfs(long long int n, long long int vis[], long long int level[],
         vector<long long int> v[]) {
  list<long long int> g;
  g.push_back(n);
  vis[n] = 1;
  level[n] = 0;
  while (!g.empty()) {
    long long int a = g.front();
    g.pop_front();
    for (long long int x = 0; x < v[a].size(); x++) {
      if (vis[v[a][x]] == 0) {
        g.push_back(v[a][x]);
        vis[v[a][x]] = 1;
        level[v[a][x]] = level[a] + 1;
      }
    }
  }
}
void dfs(long long int n, vector<long long int> v[], long long int vis[]) {
  vis[n] = 1;
  for (long long int x = 0; x < v[n].size(); x++) {
    if (vis[v[n][x]] == 0) {
      dfs(v[n][x], v, vis);
    }
  }
}
void computelpsarray(string s, long long int lps[]) {
  long long int i = 1;
  long long int j = 0;
  lps[0] = 0;
  while (i < s.length()) {
    if (s[i] == s[j]) {
      lps[i] = j + 1;
      i++;
      j++;
    } else {
      if (j == 0) {
        lps[i] = 0;
        i++;
      } else {
        j = lps[j - 1];
      }
    }
  }
}
void getZarr(string str, long long int Z[]) {
  long long int n = str.length();
  long long int L, R, k;
  L = R = 0;
  Z[0] = 0;
  for (long long int i = 1; i < n; ++i) {
    if (i > R) {
      L = R = i;
      while (R < n && str[R - L] == str[R]) R++;
      Z[i] = R - L;
      R--;
    } else {
      k = i - L;
      if (Z[k] < R - i + 1)
        Z[i] = Z[k];
      else {
        L = i;
        while (R < n && str[R - L] == str[R]) R++;
        Z[i] = R - L;
        R--;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  long long int ar[n][n];
  long long int i = 0;
  long long int p = n;
  for (long long int z = 0; z < n / 4; z++) {
    for (long long int x = 0; x < 4; x++) {
      i = x + (n * 4) * z;
      for (long long int y = 0; y < n; y++) {
        ar[4 * z + x][y] = i;
        i = i + 4;
      }
    }
  }
  for (long long int x = 0; x < n; x++) {
    for (long long int y = 0; y < n; y++) {
      cout << ar[x][y] << " ";
    }
    cout << endl;
  }
}