// #define STOPIT
#include <bits/stdc++.h>
#define loop(n) for (lint ngtkana_is_a_genius = 0; ngtkana_is_a_genius < lint(n); ngtkana_is_a_genius++)
#define rep(i, begin, end) for (lint i = lint(begin); (i) < lint(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto&& a, auto b){ if (a > b) {a = b; return true;} return false; };
auto cmx = [](auto&& a, auto b){ if (a < b) {a = b; return true;} return false; };
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { std::cerr << " " << head; debug_impl(tail...); }
#ifndef STOPIT
#define debug(...)\
  do {\
    std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
    debug_impl(__VA_ARGS__);\
    std::cerr << std::noboolalpha;\
  } while (false)
#else
#define debug(...) {}
#endif

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
  { for (auto & x : v) { is >> x; } return is; }

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
 os << "{";
  for (auto it = v.begin(); it != v.end(); it++)
    {os << (it != v.begin() ? "," : "") << *it;}
  return os << "}";
}

template <typename T>
auto make_vector_impl(size_t sz, T t) {return std::vector<T>(sz, t);}

template <size_t N, typename T, typename U, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz, U u) {return make_vector_impl(sz, T(u));}

template <size_t N, typename T, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz) {return std::vector<T>(sz);}

template <size_t N, typename T, typename... Args, std::enable_if_t<N != 1, std::nullptr_t> = nullptr>
auto make_vector(size_t a, Args... args) {return make_vector_impl(a, make_vector<N - 1, T>(args...));}

template <typename T, typename Size_t>
auto& at(T& t, Size_t i) {return t.at(i);}

template <typename T, typename Size_t, typename... Args>
auto& at(T& t, Size_t i, Args... args) {return at(t.at(i), args...);}

// require gcc >= 7.1.0
template < class ... Keys >
class fmt_t {
    using storage_t = std::tuple< Keys ... >;
    storage_t storage;
    static constexpr std::size_t N = sizeof ... (Keys);

    // is_exact_match_impl
    template < std::size_t I, class Value >
      auto is_exact_match_impl(long, Value) const
        { return false; }

    template < std::size_t I, class Value,
      std::enable_if_t<
        std::is_same< std::decay_t< Value > , char >::value
        == std::is_same< std::tuple_element_t< I, storage_t >, char >::value,
      std::nullptr_t > = nullptr,
      class = decltype(std::declval< Value >() == std::get< I >(std::declval< storage_t >())) >
      auto is_exact_match_impl(int, Value x) const
        { return x == std::get< I >(storage); }

    template < class Value, std::size_t ... Is >
      auto find_exact_match_impl(Value x, std::integer_sequence< std::size_t, Is ... >) const {
        auto ret = false;
        (void)std::initializer_list< std::nullptr_t >
          { (ret |= is_exact_match_impl< Is >(int{}, x), nullptr) ...  };
        return ret;
      }

    template < class Value >
      auto exists_exact_match(Value x) const
      {  return find_exact_match_impl(x, std::make_index_sequence< N >()); }

    // tuple_format_impl
    template < class Tuple,  std::size_t ... Is >
    std::string tuple_format_impl(const Tuple& tuple, std::integer_sequence< std::size_t, Is ... >) const {
      std::string ret = "(";
      (void)std::initializer_list< std::nullptr_t >
        { (ret = ret + (Is == 0 ? "" : ",") + format(std::get< Is >(tuple)), nullptr) ... };
      return ret + ")";
    }

    // usual_format
    template < class Value >
    std::string usual_format(long, Value x) const
      { return std::to_string(x); }

    template < class Value, std::enable_if_t< std::is_same< std::decay_t< Value >, char >::value, std::nullptr_t > = nullptr >
    std::string usual_format(int, Value c) const
      { return std::string{'\''} + std::string{c} + std::string{'\''}; }

    std::string usual_format(int, char const* s) const
      { return "\"" + std::string(s) + "\""; }

    std::string usual_format(int, std::string const s) const
      { return "\"" + s + "\""; }

    template < class Container, class = typename Container::value_type >
    std::string usual_format(int, Container const & v) const {
      return "{" + std::accumulate(v.begin(), v .end(), std::string{},
        [this](auto const& s, auto const x) { return s + (s.empty() ? "" : ",") + this->format(x); })
        + "}";
    }

    template < class Tuple, std::size_t N = std::tuple_size< Tuple >::value >
    std::string usual_format(int, Tuple const& tuple) const
      { return tuple_format_impl(tuple, std::make_index_sequence< N >()); }

    // format
    template < class Value > std::string format(Value&& x) const
      { return exists_exact_match(x) ? std::string{'_'} : usual_format(int{}, x); }

  public:
    fmt_t()=default;
    template < Keys ... > fmt_t(Keys&& ... keys ) : storage(keys ... ){}

    template < class Value > std::string operator()(Value&& x) const
      { return format(x); }
};
template < class ... Keys > auto fmt(Keys&& ... keys)
  { return fmt_t< Keys ... >(std::forward< Keys >(keys) ... ); }

template < typename Value >
auto transpose(std::vector< std::vector< Value > > const& grid) {
  int h = grid.size();
  int w = grid.front().size();
  auto ret = std::vector< std::vector< Value > > (w, std::vector< Value >(h));
  for (auto i = 0; i < h; i++) {
    for(auto j = 0; j < w; j++) {
      ret.at(j).at(i) = grid.at(i).at(j);
    }
  }
  return ret;
}

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  int n; std::cin >> n;
  if (n == 2) {
    std::cout << -1 << std::endl;
    return 0;
  }

  auto push_diag = [&] (auto&& a, auto&& b) {
    int l = a.size(), m = b.size();
    int n = l + m;
    a.resize(n);
    for (auto& v : a) v.resize(n);
    rep(i,0,m) rep(j,0,m) {
      at(a,l+i,l+j) = at(b,i,j);
    }
  };

  int per = -1;

  std::vector<std::vector<int>> unit3{
    {5,6,6},
    {5,0,7},
    {8,8,7}
  };
  std::vector<std::vector<int>> unit4 {
    {5,6,7,7},
    {5,6,8,8},
    {9,9,11,12},
    {10,10,11,12}
  };
  std::vector<std::vector<int>> unit5{
    {5,6,6,1,1},
    {5,0,7,2,2},
    {8,8,7,1,1},
    {1,2,1,0,0},
    {1,2,1,0,0}
  };
  std::vector<std::vector<int>> unit7{
    {5,6,6,3,3,0,0},
    {5,0,7,4,4,0,0},
    {8,8,7,0,0,2,2},
    {3,4,0,0,0,1,1},
    {3,4,0,0,0,2,2},
    {0,0,1,2,1,0,0},
    {0,0,1,2,1,0,0}
  };

  auto grid = [&] {
    std::vector<std::vector<int>> unit;
    auto grid = make_vector<2,int>(0,0);
    if (n % 3 == 0) {
      per = 3;
      unit = unit3;
    } else if (n % 4 == 0) {
      per = 4;
      unit = unit4;
    } else if (n % 5 == 0) {
      per = 5;
      unit = unit5;
    } else {
      int x = n % 4;
      int y = n - 5 * x;
      if (y < 0) {
        if (n==7) return unit7;
        push_diag(grid,unit7);
        push_diag(grid,unit4);
      }
      loop(x) push_diag(grid,unit5);
      loop(y) push_diag(grid,unit4);
    }
    debug(per);
    assert(n % per == 0);
    loop(n/per) {
      push_diag(grid,unit);
    }

    // rep(i,0,n) rep(j,0,n) {
    //   if (i/per != j/per) continue;
    //   debug(i,j);
    //   int di = i % per, dj = j % per;
    //   int x = at(unit,di,dj);
    //   if (x == 0) continue;
    //   at(grid,i,j) = x;
    // }
    return grid;
  }();

  auto ans = make_vector<2,char>(n,n);
  rep(i,0,n) rep(j,0,n) {
    int x = at(grid,i,j);
    char & c = at(ans,i,j);
    if (x==0) {
      c = '.';
    } else {
      c = 'a' + x - 1;
    }
  }
  for (auto&& v : ans) {
    for (char c : v) {
      std::cout << c;
    }
    std::cout << std::endl;
  }

  // check
  auto check = [&] {
    std::vector<int> tester;
    loop(2) {
      for (auto&& v : ans) {
        int now = 0;
        rep(i,0,n) {
          char c = v.at(i);
          if (c=='.') continue;
          now += i==0 || v.at(i-1)!=c;
        }
        tester.push_back(now);
      }
      ans = transpose(ans);
    }
    debug(tester);
    tester.resize(std::unique(all(tester)) - tester.begin());
    assert(tester.size() == 1u);
  };
  #ifndef STOPIT
    check();
  #endif
  return 0;
}

Measured memory_bytes: 83200