Problem: Let's consider an n × n square matrix, consisting of digits one and zero.

We'll consider a matrix good, if it meets the following condition: in each row of the matrix all ones go in one group. That is, each row of the matrix looks like that 00...0011...1100...00 (or simply consists of zeroes if it has no ones).

You are given matrix a of size n × n, consisting of zeroes and ones. Your task is to determine whether you can get a good matrix b from it by rearranging the columns or not.

Input

The first line contains integer n (1 ≤ n ≤ 500) — the size of matrix a.

Each of n following lines contains n characters "0" and "1" — matrix a. Note that the characters are written without separators.

Output

Print "YES" in the first line, if you can rearrange the matrix columns so as to get a good matrix b. In the next n lines print the good matrix b. If there are multiple answers, you are allowed to print any of them.

If it is impossible to get a good matrix, print "NO".

Examples

Input

6
100010
110110
011001
010010
000100
011001


Output

YES
011000
111100
000111
001100
100000
000111


Input

3
110
101
011


Output

NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
bool debug = false;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
const int undefined = 0;
const int typeLeaf = 0;
const int typePerm = 1;
const int typeRev = 2;
const int sigEmpty = 0;
const int sigFull = 1;
const int sigPartial = 2;
const int sigRoot = 3;
struct PQTree {
  int type, mes;
  vector<PQTree*> sub;
  void init() {
    sub.clear();
    type = typeLeaf;
    mes = undefined;
  }
  PQTree() { init(); }
};
namespace GC {
stack<PQTree*> buffer;
void release() {
  while (buffer.size()) buffer.pop();
}
PQTree* assign() {
  if (buffer.size()) {
    PQTree* ret = buffer.top();
    buffer.pop();
    ret->init();
    return ret;
  } else
    return new PQTree;
}
PQTree* assign_leaf(int l) {
  PQTree* ret = assign();
  ret->mes = l;
  return ret;
}
void deassign(PQTree* x) { buffer.push(x); }
};  // namespace GC
PQTree* Universal(int N) {
  if (N == 1) return GC::assign_leaf(1);
  PQTree* root = GC::assign();
  root->type = typePerm;
  for (int i = 1; i <= N; i++) root->sub.push_back(GC::assign_leaf(i));
  return root;
}
void claimNoSol() {
  printf("NO\n");
  exit(0);
}
PQTree* Pertinent(PQTree* ths, int* E) {
  if (ths->type == typeLeaf) return (E[ths->mes]) ? ths : NULL;
  PQTree* ret = NULL;
  for (vector<PQTree*>::iterator it = ths->sub.begin(); it != ths->sub.end();
       it++) {
    PQTree* sret = Pertinent(*it, E);
    if (ret == NULL)
      ret = sret;
    else if (sret)
      ret = ths;
  }
  return ret;
}
PQTree* groupIt(vector<PQTree*>& g) {
  PQTree* grouped;
  if (g.size() == 1)
    grouped = g[0];
  else {
    grouped = GC::assign();
    grouped->type = typePerm;
    grouped->sub = g;
  }
  return grouped;
}
bool allEqual(vector<int>::iterator S, vector<int>::iterator E, int x) {
  while (S < E) {
    if (*S != x) return false;
    S++;
  }
  return true;
}
int Reduce(PQTree* cur, int* E, bool isRoot) {
  switch (cur->type) {
    case typeLeaf:
      return E[cur->mes] ? sigFull : sigEmpty;
      break;
    case typePerm: {
      vector<PQTree*> sj[3];
      sj[sigEmpty].clear();
      sj[sigFull].clear();
      sj[sigPartial].clear();
      for (vector<PQTree*>::iterator it = cur->sub.begin();
           it != cur->sub.end(); it++)
        sj[Reduce(*it, E, false)].push_back(*it);
      if (sj[sigPartial].size() == 0) {
        if (sj[sigFull].size() == 0) return sigEmpty;
        if (sj[sigFull].size() == cur->sub.size()) return sigFull;
        if (isRoot) {
          cur->sub = sj[sigEmpty];
          cur->sub.push_back(groupIt(sj[sigFull]));
          return sigRoot;
        } else {
          cur->sub.clear();
          cur->type = typeRev;
          cur->sub.push_back(groupIt(sj[sigEmpty]));
          cur->sub.push_back(groupIt(sj[sigFull]));
          return sigPartial;
        }
      }
      if (sj[sigPartial].size() == 1)
        if (isRoot) {
          if (sj[sigFull].size()) {
            cur->sub = sj[sigEmpty];
            cur->sub.push_back(sj[sigPartial][0]);
            cur->sub.back()->sub.push_back(groupIt(sj[sigFull]));
          }
          return sigRoot;
        } else {
          cur->sub.clear();
          cur->type = typeRev;
          if (sj[sigEmpty].size()) cur->sub.push_back(groupIt(sj[sigEmpty]));
          cur->sub.insert(cur->sub.end(), sj[sigPartial][0]->sub.begin(),
                          sj[sigPartial][0]->sub.end());
          if (sj[sigFull].size()) cur->sub.push_back(groupIt(sj[sigFull]));
          return sigPartial;
        }
      if (sj[sigPartial].size() == 2) {
        if (!isRoot) claimNoSol();
        cur->sub = sj[sigEmpty];
        cur->sub.push_back(sj[sigPartial][0]);
        if (sj[sigFull].size())
          cur->sub.back()->sub.push_back(groupIt(sj[sigFull]));
        reverse(sj[sigPartial][1]->sub.begin(), sj[sigPartial][1]->sub.end());
        cur->sub.back()->sub.insert(cur->sub.back()->sub.end(),
                                    sj[sigPartial][1]->sub.begin(),
                                    sj[sigPartial][1]->sub.end());
        GC::deassign(sj[sigPartial][1]);
        return sigRoot;
      }
      claimNoSol();
    } break;
    case typeRev: {
      vector<int> rets;
      rets.clear();
      for (vector<PQTree*>::iterator it = cur->sub.begin();
           it != cur->sub.end(); it++)
        rets.push_back(Reduce(*it, E, false));
      if (allEqual(rets.begin(), rets.end(), sigEmpty)) return sigEmpty;
      if (allEqual(rets.begin(), rets.end(), sigFull)) return sigFull;
      vector<int> partialIdx;
      partialIdx.clear();
      for (vector<int>::iterator it = rets.begin(); it != rets.end(); it++)
        if (*it == sigPartial) partialIdx.push_back(it - rets.begin());
      int firstPertinent, lastPertinent;
      for (vector<int>::iterator it = rets.begin(); it != rets.end(); it++)
        if (*it != sigEmpty) {
          firstPertinent = it - rets.begin();
          break;
        }
      for (vector<int>::iterator it = rets.begin(); it != rets.end(); it++)
        if (*it != sigEmpty) lastPertinent = it - rets.begin();
      if (!allEqual(rets.begin() + firstPertinent + 1,
                    rets.begin() + lastPertinent, sigFull))
        claimNoSol();
      if ((firstPertinent == lastPertinent) && (isRoot)) {
        return sigRoot;
      }
      if ((lastPertinent == 0) && (rets[0] == sigPartial)) {
        PQTree* s = cur->sub[0];
        cur->sub.erase(cur->sub.begin());
        reverse(cur->sub.begin(), cur->sub.end());
        cur->sub.insert(cur->sub.end(), s->sub.begin(), s->sub.end());
        GC::deassign(s);
        return sigPartial;
      }
      if ((firstPertinent == rets.size() - 1) && (rets.back() == sigPartial)) {
        PQTree* s = cur->sub.back();
        cur->sub.pop_back();
        cur->sub.insert(cur->sub.end(), s->sub.begin(), s->sub.end());
        GC::deassign(s);
        return sigPartial;
      }
      if ((firstPertinent == 0) && (rets[0] == sigFull)) {
        if (rets[lastPertinent] == sigPartial) {
          PQTree* s = cur->sub[lastPertinent];
          reverse(s->sub.begin(), s->sub.end());
          cur->sub.erase(cur->sub.begin() + lastPertinent);
          cur->sub.insert(cur->sub.begin() + lastPertinent, s->sub.begin(),
                          s->sub.end());
          GC::deassign(s);
        }
        reverse(cur->sub.begin(), cur->sub.end());
        return sigPartial;
      }
      if ((lastPertinent == rets.size() - 1) && (rets.back() == sigFull)) {
        if (rets[firstPertinent] == sigPartial) {
          PQTree* s = cur->sub[firstPertinent];
          cur->sub.erase(cur->sub.begin() + firstPertinent);
          cur->sub.insert(cur->sub.begin() + firstPertinent, s->sub.begin(),
                          s->sub.end());
          GC::deassign(s);
        }
        return sigPartial;
      }
      if (isRoot) {
        if (rets[lastPertinent] == sigPartial) {
          PQTree* s = cur->sub[lastPertinent];
          reverse(s->sub.begin(), s->sub.end());
          cur->sub.erase(cur->sub.begin() + lastPertinent);
          cur->sub.insert(cur->sub.begin() + lastPertinent, s->sub.begin(),
                          s->sub.end());
          GC::deassign(s);
        }
        if (rets[firstPertinent] == sigPartial) {
          PQTree* s = cur->sub[firstPertinent];
          cur->sub.erase(cur->sub.begin() + firstPertinent);
          cur->sub.insert(cur->sub.begin() + firstPertinent, s->sub.begin(),
                          s->sub.end());
          GC::deassign(s);
        }
        return sigRoot;
      }
      claimNoSol();
    } break;
  }
  return -1;
}
vector<int> frontier;
void getFrontier(PQTree* cur) {
  if (cur->type == typeLeaf)
    frontier.push_back(cur->mes);
  else
    for (auto it = cur->sub.begin(); it != cur->sub.end(); it++)
      getFrontier(*it);
}
char s[505][505];
int row[505];
int main() {
  scanf("%d", &n);
  GC::release();
  PQTree* root = Universal(n);
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    scanf("%s", s[i]);
    for (int(j) = 0; (j) < (int)(n); (j)++) row[j + 1] = s[i][j] - '0';
    PQTree* x = Pertinent(root, row);
    if (x == NULL) continue;
    Reduce(x, row, 1);
  }
  puts("YES");
  getFrontier(root);
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    for (int(j) = 0; (j) < (int)(n); (j)++) {
      printf("%c", s[i][frontier[j] - 1]);
    }
    puts("");
  }
  return 0;
}