#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

int v4[4][4] = {1,8,13,12,
                14,11,2,7,
                4,5,16,9,
                15,10,3,6};

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

int ans[16][16];

int main() {
  REP(i,16) {
    REP(j,16) {
      v16[i][j] = (v4[i/4][j/4]-1) * 16 + v4[i%4][j%4];
    }
  }
  int n,x,y,z;
  while(input(n,x,y,z)) {
    auto v = vector<vector<int>>(n,vector<int>(n));
    if (n == 4) REP(i,n)REP(j,n) v[i][j]=v4[i][j];
    else if (n == 8) REP(i,n)REP(j,n) v[i][j]=v8[i][j];
    else REP(i,n)REP(j,n) v[i][j]=v16[i][j];

    y--;x--;
    int Y=-1,X=-1;
    REP(i,n)REP(j,n) {
      if (v[i][j]==z) {
        Y = i, X = j;
      }
    }
    REP(i,n) REP(j,n) {
      ans[i][j] = v[(i+Y-y+n)%n][(j+X-x+n)%n];
    }
    // cout << tpl(n,y,x,z,Y,X) << endl;
    int sum = 0;
    REP(i,n) sum += ans[0][i];
    int s1 = 0, s2 = 0;
    REP(i,n) {
      s1 += ans[i][i];
      s2 += ans[n-i-1][i];
    }
    assert(sum==s1);
    assert(sum==s2);
    REP(i,n) {
      int s1 = 0, s2 = 0;
      REP(j,n) {
        s1 += ans[i][j];
        s2 += ans[j][i];
      }
      assert(sum == s1);
      assert(sum == s2);
    }
    assert(ans[y][x] == z);
    // REP(i,n) {
    //   REP(j,n) printf("%d%c", ans[i][j], j!=n-1?' ':'\n');
    // }
  }
}