//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

const int N = 7;
const int K = 3;

vector<string> tiga = {
  "aa.",
  "..b",
  "..b"
};
vector <string> empat = {
  "aabc",
  "ddbc",
  "efgg",
  "efhh"
};
vector <string> lima = {
  "..abc",
  "..abc",
  "ddggi",
  "eeh.i",
  "ffhjj"
};
vector <string> enam = {
  "...abc",
  "...abc",
  "ddee.f",
  "..gghf",
  "iij.h.",
  "kkj.ll",
};
vector<string> tujuh = {
  "....abc",
  "....abc",
  "....def",
  "....def",
  "ggjj..m",
  "hhkk..m",
  "iillnn.",
};

int dah[N][N];
int adax[N],aday[N];
int taruh[N][N];

// bool bisa()
// {
//   REP(i,N)
//   {
//     if (adax[i] > K) return false;
//   }
// }

void bf(int x,int y)
{
  // REP(i,N) if (adax[i] > K) return;
  // REP(i,N) if (aday[i] > K) return;
  if (y == N)
  {
    y = 0;
    ++x;
  }
  if (x == N && y == 0)
  {
    REP(i,N) if (adax[i] != K) return;
    REP(i,N) if (aday[i] != K) return;
    REP(i,N)
    {
      REP(j,N) printf("%d",taruh[i][j]);
      puts("");
    }
    exit(0);
  }
  FORN(i,-1,0)
  {
    if (x + i >= 0 && adax[x + i] > K) return;
    if (y + i >= 0 && aday[y + i] > K) return;
  }
  bf(x,y+1);
  if (!dah[x][y])
  {
    if (y < N - 1 && !dah[x][y+1]) 
    {
      taruh[x][y] = 1;
      ++adax[x];
      ++aday[y];
      ++aday[y+1];
      dah[x][y] = dah[x][y+1] = 1;
      bf(x,y+1);
      taruh[x][y] = 0;
      --adax[x];
      --aday[y];
      --aday[y+1];
      dah[x][y] = dah[x][y+1] = 0;
    }
    if (x < N - 1 && !dah[x+1][y])
    {
      taruh[x][y] = 2;
      ++adax[x];
      ++adax[x+1];
      ++aday[y];
      dah[x][y] = dah[x+1][y] = 1;
      bf(x,y+1);
      taruh[x][y] = 0;
      --adax[x];
      --adax[x+1];
      --aday[y];
      dah[x][y] = dah[x+1][y] = 0;
    }
  }
}

int n;
string risan[1005];

int main()
{
  // bf(0,0);
  // FORN(i,3,1000)
  // {
  //   if (i % 3 == 0 || i % 4 == 0) continue;
  //   printf("%d\n",i);
  // }
  vector<vector<string>> ans;
  scanf("%d",&n);
  if (n == 2) puts("-1");
  else if (n == 3) ans = {tiga};
  else if (n == 6) ans = {enam};
  else if (n == 7) ans = {tujuh};
  else if (n == 11) ans = {lima, enam};
  else
  {
    FORN(i,0,n)
    {
      if (4 * i > n) break;
      if ((n - 4 * i) % 5 == 0)
      {
        REP(j,i) ans.pb(empat);
        REP(j,(n-4*i)/5) ans.pb(lima);
        break;
      }
    }
  }
  if (SIZE(ans) > 0)
  {
    REP(i,n) risan[i] = string(n,'.');
    int now = 0;
    REP(i,SIZE(ans))
    {
      int x = SIZE(ans[i]);
      REP(j,x) REP(k,x) risan[now+j][now+k] = ans[i][j][k];
      now += x;
    }
    assert(now == n);
    REP(i,n) printf("%s\n",risan[i].c_str());
  }
  return 0;
}











Measured memory_bytes: 2304