#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <array>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define req(i, a, b) for (ll i = (a); i < (b); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n'
#define debug2(x, y) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << '\n'
#define debug3(x, y, z) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << ',' << #z << ':' << (z) << '\n'
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
template<class T> using P = pair<T, T>;
template<class T> using pri_l = priority_queue<T>;
template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000010;
constexpr int inf2 = 2000000010;
constexpr ll INF = 1000000000000000010;
constexpr ll INF4 = 4000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1,0 }; int dy[] = { 0,1,0,-1,1,-1,1,-1,0 };
ll mul(ll a, ll b) { return (b != 0 && a > INF / b ? INF : a * b); }
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T> void er(T a) { cout << a << '\n'; exit(0); }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream& operator >>(istream& s, vector<T>& v) { for (auto& e : v) s >> e; return s; }
template<class T> ostream& operator <<(ostream& s, const vector<T>& v) { for (auto& e : v) s << e << ' '; return s; }
template<class T, class U> ostream& operator << (ostream& s, const pair<T, U>& p) { s << p.first << ' ' << p.second; return s; }

struct fastio {
	fastio() {
		cin.tie(0); cout.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(20);
		cerr << fixed << setprecision(20);
	}
}fastio_;

namespace rdv {
	random_device seed_gen;
	mt19937_64 engine(seed_gen());
	ll rnum(ll r) { return engine() % r; } // [0, r)
	ll rnum(ll l, ll r) { return rnum(r - l) + l; } // [l, r)
	ll rng(ll l, ll r) { return rnum(l, r + 1); } // [l, r]
	double rng01() { return engine() * pow(2, -64); }
	template<class T> void shuf(vector<T>& v) { shuffle(all(v), engine); }
	void shuf(string& s) { shuffle(all(s), engine); }
}

using namespace rdv;

template<class T> vector<int> compress(vector<T> v) {
	int n = v.size();
	vector<T> tmp = v;
	sort(tmp.begin(), tmp.end());
	tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
	vector<int> res(n);
	for (int i = 0; i < n; i++) res[i] = lower_bound(tmp.begin(), tmp.end(), v[i]) - tmp.begin();
	return res;
}

#include <atcoder/all>
using namespace atcoder;

constexpr ll mod = mod998;
using mint = static_modint<mod>;

istream& operator >>(istream& s, mint& m) { ll y; s >> y; m = y; return s; }
ostream& operator <<(ostream& s, mint& m) { return s << m.val(); }
ostream& operator <<(ostream& s, const vector<mint>& v) { for (auto& e : v) s << e.val() << ' '; return s; }

vector<mint> fac, inv, facinv;

void modcalc(int n) {
	fac.resize(n); inv.resize(n); facinv.resize(n);
	fac[0] = 1; fac[1] = 1; inv[1] = 1;
	facinv[0] = 1; facinv[1] = 1;
	for (ll i = 2; i < n; i++) {
		fac[i] = fac[i - 1] * i;
		inv[i] = -inv[mod % i] * (mod / i);
		facinv[i] = facinv[i - 1] * inv[i];
	}
}

mint comb(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[k] * facinv[n - k];
}

mint perm(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[n - k];
}

mint hom(ll n, ll k) {
	if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
	if (n == 0 && k == 0) return 1;
	return fac[n + k - 1] * facinv[k] * facinv[n - 1];
}

class unionfind {
	vector<int> par;
	vector<int> sz;
public:
	unionfind(int n) {
		par = vector<int>(n);
		for (int i = 0; i < n; i++) par[i] = i;
		sz = vector<int>(n, 1);
	}
	unionfind(int n, vector<int> a) {
		par = vector<int>(n);
		for (int i = 0; i < n; i++) par[i] = i;
		sz = a;
	}
	int find(int x) {
		if (par[x] == x) return x;
		else return par[x] = find(par[x]);
	}
	int size(int x) { return sz[find(x)]; }
	bool same(int x, int y) { return find(x) == find(y); }
	void unite(int x, int y) {
		x = find(x);
		y = find(y);
		if (x == y) return;
		if (sz[x] < sz[y]) {
			par[x] = y;
			sz[y] += sz[x];
		}
		else {
			par[y] = x;
			sz[x] += sz[y];
		}
	}
};

int main() {

	bool DEBUG = false;

	int TEST = 1;
	if (DEBUG) cin >> TEST;
	while (TEST--) {
		int n;
		cin >> n;

		if (n == 8 or n == 12) {
			cout << "-1\n";
			continue;
		}

		if (n <= 7) {
			vector a(n, vector<char>(n));
			rep(i, n) rep(j, n) {
				if ((i + j) % 2 == 0) a[i][j] = '#';
				else a[i][j] = '.';
			}
			vector<P<int>> p;
			rep(i, n) rep(j, n) {
				if ((i + j) % 2 == 0) p.push_back({ i, j });
			}
			rep(i, 1LL << ssize(p)) {
				unionfind uf(n * n);
				vector b = a;
				rep(j, ssize(p)) {
					if (i >> j & 1) {
						b[p[j].first][p[j].second] = '.';
					}
				}
				bool bad = false;
				rep(x, n) rep(y, n - 1) {
					if (b[x][y] == '.' && b[x][y + 1] == '.') {
						if (uf.same(x * n + y, x * n + y + 1)) {
							bad = true;
							break;
						}
						uf.unite(x * n + y, x * n + y + 1);
					}
				}
				rep(x, n - 1) rep(y, n) {
					if (b[x][y] == '.' && b[x + 1][y] == '.') {
						if (uf.same(x * n + y, x * n + y + n)) {
							bad = true;
							break;
						}
						uf.unite(x * n + y, x * n + y + n);
					}
				}
				if (bad) {
					ll w = 0;
					ll x = i;
					while (x % 2 == 0) {
						x /= 2;
						w++;
					}
					i += 1LL << w;
					i--;
					continue;
				}
				rep(x, n) rep(y, n) if (b[x][y] == '.' && !uf.same(1, x * n + y)) bad = true;
				if (!bad) {
					rep(x, n) {
						rep(y, n) cout << b[x][y];
						cout << '\n';
					}
					return 0;
				}
			}
		}

		assert(n >= 9);

		vector a(n, vector<char>(n, '.'));
		rep(i, n) rep(j, n) if (i % 2 == 1 && j % 2 == 1) a[i][j] = '#';
		int d = (n + 1) / 2;
		vector b(d, vector<char>(d, '.'));
		auto op = [&](int i, int j) { a[2 * i][2 * j] ^= '.' ^ '#'; b[i][j] ^= '.' ^ '#'; };
		ll t = d;
		while (t >= 10 or t == 8) {
			for (int i = t - 2; i >= 0; i -= 2) {
				op(i, t - 2);
				if (i != t - 2) op(t - 2, i);
			}
			for (int i = t - 3; i >= 0; i -= 2) {
				op(i, t - 3);
				if (i != t - 3) op(t - 3, i);
			}
			t -= 3;
		}

		if (t == 5) {
			op(0, 1); op(1, 3); op(2, 0); op(2, 2); op(3, 1); op(3, 3);
		}
		if (t == 7) {
			op(0, 3); op(1, 1); op(1, 5); op(2, 0); op(2, 2); op(2, 4); op(3, 5); op(4, 0); op(4, 2); op(4, 4); op(5, 1); op(5, 3); op(5, 5);
		}
		if (t == 9) {
			op(0, 0); op(0, 5); op(1, 1); op(1, 3); op(1, 7); op(2, 4); op(2, 6); op(3, 1); op(3, 3); op(3, 7); op(4, 0); op(4, 2); op(4, 4); op(4, 6); op(5, 7); op(6, 0); op(6, 2); op(6, 4); op(6, 6); op(7, 1); op(7, 3); op(7, 5); op(7, 7);
		}

		for (int j = 6; j < d; j++) {
			if (b[0][j] == '#' && b[0][j - 1] == '.' && b[0][j - 2] == '#') {
				op(0, j); op(0, j - 1); op(0, j - 2);
			}
		}
		if ((d > 9 or d == 8) && b[0][d - 2] == '#') {
			op(0, d - 5); op(1, d - 5); op(1, d - 4); op(1, d - 3);
		}

		if (n == 11) {
			op(0, 0); op(0, 2); op(0, 4); op(2, 1); op(2, 3); op(2, 5); op(3, 2); op(3, 4); op(4, 0); op(5, 2); op(5, 4);
		}

		if (DEBUG) {
			rep(i, d) {
				rep(j, d) cerr << b[i][j];
				cerr << '\n';
			}
		}

		rep(i, n) {
			rep(j, n) cout << a[i][j];
			cout << '\n';
		}

		if (DEBUG) {
			bool bad = false;
			unionfind uf(n * n);
			rep(x, n) rep(y, n - 1) {
				if (a[x][y] == '.' && a[x][y + 1] == '.') {
					if (uf.same(x * n + y, x * n + y + 1)) {
						debug2(x, y);
						bad = true;
						break;
					}
					uf.unite(x * n + y, x * n + y + 1);
				}
			}
			rep(x, n - 1) rep(y, n) {
				if (a[x][y] == '.' && a[x + 1][y] == '.') {
					if (uf.same(x * n + y, x * n + y + n)) {
						debug2(x, y);
						bad = true;
						break;
					}
					uf.unite(x * n + y, x * n + y + n);
				}
			}
			debug(bad);
			rep(x, n) rep(y, n) if (a[x][y] == '.' && !uf.same(1, x * n + y)) bad = true;
			assert(!bad);
		}
	}

	cout << "-\n";

}