#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;cin>>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>ostream& operator<<(ostream&o,const vv<T>&v){for(auto&r:v)o<<r<<'\n';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>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 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>void operator+=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi+=b.fi;a.se+=b.se;}
template<class T1,class T2>void operator-=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi-=b.fi;a.se-=b.se;}
template<class T1,class T2>void operator*=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi*=b.fi;a.se*=b.se;}
template<class T>void operator*=(pair<T,T>&a,T b){a.fi*=b;a.se*=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 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>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 T1,class T2>void prepend(vc<T1>&a,const T2&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 ye { cout<<"Yes"<<'\n';}
#define no { cout<<"No"<<'\n'; return;}
#define yn {cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define endl '\n'
using vs = vc<string>;
void vin(vs& s){int n,m;cin>>n>>m;s=vs(n);cin>>s;}
template<typename T>void rot(T& a,int i){rotate(a.begin(),a.begin()+(i),a.end());}
template<typename T>void rot(vc<T>& a){int h=sz(a),w=sz(a[0]);vc<T> p(w,T(h,0));swap(a,p);rep(i,h)rep(j,w)a[j][h-1-i]=p[i][j];}

// maximize
static const int N = 128;
using bs = bitset<N>;
struct BitVector {
  vc<bs> d, mask;
  BitVector():d(N),mask(N) {}
  bs sol(bs& b) {
    bs m;
    rep(i,N) if (b[i]) {
      b ^= d[i];
      m ^= mask[i];
    }
    return m;
  }
  void add(bs b, int id) {
    bs m = sol(b);
    m[id] = 1;
    rep(i,N) if (b[i]) {
      d[i] = b;
      mask[i] = m;
      rep(j,N) if (i != j && d[j][i]) {
        d[j] ^= b;
        mask[j] ^= m;
      }
      return;
    }
  }
};

struct Solver {
  void solve() {
    int n;
    cin>>n;
    vs s(n);
    cin>>s;
    vvi a(n,vi(n));
    rep(i,n)rep(j,n) a[i][j] = s[i][j]=='#';
    vc<tuple<int,int,int>> ans;

    auto f = [&](int i, int j, int k, int rots=0) {
      rep(l,k*2+1) a[i-k+l][j-k+l] ^= 1;
      rep(l,k*2+1) a[i+k-l][j-k+l] ^= 1;
      a[i][j] ^= 1;
      rep(ri,4-rots) {
        swap(i,j);
        j = n-1-j;
      }
      ans.eb(k,i+1,j+1);
    };

    if (n < 12) {
      BitVector d;
      vvi id(n,vi(n));
      rep(i,n)rep(j,n) id[i][j] = i*n+j;
      vc<tuple<int,int,int>> ts;
      for (int k = 1; k*2+1 <= n; k++) {
        srep(i,k,n-k)srep(j,k,n-k) {
          bs b;
          rep(l,k*2+1) b.flip(id[i-k+l][j-k+l]);
          rep(l,k*2+1) b.flip(id[i+k-l][j-k+l]);
          b.flip(id[i][j]);
          d.add(b,sz(ts));
          ts.eb(i,j,k);
        }
      }
      bs b;
      rep(i,n)rep(j,n) b[id[i][j]] = a[i][j];
      bs m = d.sol(b);
      if (b.count()) dame;
      rep(mi,N) if (m[mi]) {
        auto [i,j,k] = ts[mi];
        f(i,j,k);
      }
    } else {
      rep(ri,4) {
        rep(j,n-2) {
          if (a[0][j]) f(1,j+1,1,ri);
        }
        rot(a);
      }
      rep(ri,4) {
        if (a[1][1]) f(2,2,1,ri);
        rot(a);
      }

      rep(ri,4) {
        srep(j,2,n-7) {
          if (a[1][j]) f(2,j+1,1,ri);
        }
        for (int j = n-3; j >= n-5; j--) {
          if (a[1][j]) f(2,j-1,1,ri);
        }
        for (int j = n-6; j >= n-7; j--) {
          if (a[1][j]) {
            f(1,j+2,1,ri);
            f(2,j-1,2,ri);
            f(3,j,3,ri);
          }
        }
        rot(a);
      }

      srep(i,2,n-2)srep(j,2,n-2) {
        if (a[i][j]) {
          f(i,j,2);
          for (int di : {-1,1})for(int dj : {-1,1}) f(i+di,j+dj,1);
        }
      }
    }

    rep(i,n)rep(j,n) if (a[i][j]) dame;

    {
      map<tuple<int,int,int>,int> mp;
      for (auto t : ans) mp[t] ^= 1;
      ans.resize(0);
      for (auto [t,x] : mp) if (x) ans.pb(t);
    }

    cout<<sz(ans)<<endl;
    for (auto [k,i,j] : ans) cout<<k<<" "<<i<<" "<<j<<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;
}