#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { cout<<"-1"<<'\n'; return;}
#define yes { cout<<"Yes"<<'\n'; return;}
#define no { cout<<"No"<<'\n'; return;}
#define yn {cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
using vs = vc<string>;
void vin(vs& s){int n,m;cin>>n>>m;s=vs(n);cin>>s;}

struct Solver {
  void solve() {
    int n;
    cin>>n;
    vs s(n,string(n,'.'));
    if (n%2) {
      for (int i = 1; i < n;) {
        for (int j = 1; j <= i; j += 2) s[i][j] = '#';
        i++;
        for (int j = i; j >= 0; j -= 6) s[i][j] = '#';
        if (i%12 == 8) {
          s[i][2] = s[i-2][0] = '.';
          s[i-2][2] = '#';
        }
        if (i%12 == 10) {
          s[i][0] = '#';
        }
        if (i%12 == 0) {
          s[i][0] = '.';
        }
        i++;
      }
      rep(i,n)rep(j,i) s[j][i] = s[i][j];
    } else {
      // ok: 2,4,6,10,14,18,34
      // ng: 8,12
      if (n == 2) {
        s[0][0] = '#';
      /*
      } else if (pcnt(n-2) == 1) {
        auto f = [&](auto f, int si, int sj, int w) -> void {
          if (w == 1) {
            s[si][sj] = '#';
            return;
          }
          w /= 2;
          s[si+w][sj+w] = '#';
          f(f,si,sj,w);
          f(f,si+w+1,sj,w);
          f(f,si,sj+w+1,w);
          f(f,si+w+1,sj+w+1,w);
        };
        f(f,1,1,n-3);
        for (int i = 1; i < n; i += 2) s[n-1][i] = s[i][n-1] = '#';
        s[0][0] = '#';//*/
      } else {
        if (n == 8 || n == 12) dame;
        rep(i,n)rep(j,n) if (i%2 && j%2) s[i][j] = '#';
        for (int i = n-4; i >= 2; i -= 6) {
          for (int j = i, k = 0; j >= 0; j -= 2, k ^= 2) s[i-k][j] = '#';
        }
        if (n%6 == 4) {
          s[0][0] = '#';
          rep(i,n)rep(j,i) s[j][i] = s[i][j];

          if (n%12 == 10) {
            for (int i = 4; i < n; i += 6) swap(s[i-2][0], s[i][0]), s[i-4][0] = '.';
          } else {
            s[n-6][2] = '.';
            s[n-8][2] = '#';
            s[n-10][2] = '.';
            s[n-10][0] = '#';
            for (int i = 4; i < n-10; i += 6) swap(s[i-2][0], s[i][0]), s[i-4][0] = '.';
          }
        }
        if (n%6 == 2) {
          // s[0][0] = '#';
          rep(i,n)rep(j,i) s[j][i] = s[i][j];
          if (n%12 == 2) {
            for (int i = 6; i < n; i += 6) swap(s[i-2][0], s[i][0]), s[i-4][0] = '.';
          } else {
            // s[n-6][2] = '.';
            // s[n-8][2] = '#';
            // s[n-10][2] = '.';
            // s[n-10][0] = '#';
            for (int i = 6; i < n-10; i += 6) swap(s[i-2][0], s[i][0]), s[i-4][0] = '.';
              //TODO
          }
        }
        if (n%6 == 0) dame; // TODO
      }
    }
    
    rep(i,n) cout<<s[i]<<endl;
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // cin >> ts;
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}