output_description: For each dataset, output the shortest spell.
input_description: The first line of each test case has an integer _n_. Following _n_ lines are
  information of an array of enemies. The format is same as described in the
  problem statement.
  
  Input terminates when n = 0. You may assume that one or more enemy have
  fighting capability.
attempt: code = """\
  #include <bits/stdc++.h>
  using namespace std;
  
  #define repi(i,a,b) for(int i=int(a);i<int(b);i++)
  #define rep(i,n) repi(i,0,n)
  #define all(c) begin(c),end(c)
  
  int main()
  {
  	static array<int,225> ms;
  	{
  		int k=0;
  		rep(t,5) repi(b,t,5) rep(l,5) repi(r,l,5){
  			int m=0;
  			repi(i,t,b+1) repi(j,l,r+1) m|=1<<(i*5+j);
  			ms[k++]=m;
  		}
  	}
  	
  	static array<uint8_t,1<<25> ds; ds.fill(-1); ds[0]=0;
  	for(int i=0;count(all(ds),i);i++)
  		rep(j,1<<25) if(ds[j]==i)
  			for(int m:ms) ds[j^m]=min<uint8_t>(ds[j^m],i+1);
  	
  	for(int n;cin>>n && n;){
  		int x=0;
  		rep(i,n) rep(j,n){
  			int b; cin>>b;
  			x|=b<<(i*5+j);
  		}
  		string res;
  		rep(i,ds[x]) res+="myon";
  		cout<<res<<endl;
  	}
  }
  """
  
  import os, tempfile
  
  (_, filename) = tempfile.mkstemp(".cpp")
  
  f = open(filename, "w")
  f.write(code)
  f.close()
  
  os.system("g++ -std=c++0x -O2 {}".format(filename))
  os.system("./a.out")
  
problem_description: I: Mysterious Onslaught
  
  In 2012, human beings have been exposed to fierce onslaught of unidentified
  mysterious extra-terrestrial creatures. We have exhaused because of the long
  war and can't regist against them any longer. Only you, an excellent wizard,
  can save us. Yes, it's time to stand up!
  
  The enemies are dispatched to the earth with being aligned like an _n_ * _n_
  square. Appearently some of them have already lost their fighting capabilities
  for some unexpected reason. You have invented a highest grade magic spell
  'MYON' to defeat them all. An attack of this magic covers any rectangles
  (which is parallel to axis). Once you cast a spell "myon," then all the
  enemies which the magic covers will lose their fighting capabilities because
  of tremendous power of the magic. However, the magic seems to activate
  enemies' self-repairing circuit. Therefore if any enemy which have already
  lost its fighting capability is exposed to the magic, the enemy repossesses
  its fighting capability. You will win the war when all the enemies will lose
  their fighting capabilities.
  
  Let me show an example. An array of enemies below have dispatched:
  
      
      
      1 1 1 1 1
      1 0 0 0 1
      1 0 1 0 1
      1 0 0 0 1
      1 1 1 1 1
      
  
  Here, '0' means an enemy that doesn't possess fighting capability, and '1'
  means an enemy that possesses. First, you cast a spell "myon" with covering
  all the enemies, which results in;
  
      
      
      0 0 0 0 0
      0 1 1 1 0
      0 1 0 1 0
      0 1 1 1 0
      0 0 0 0 0
      
  
  Next, cast once again with covering central 3 * 3 enemies.
  
      
      
      0 0 0 0 0
      0 0 0 0 0
      0 0 1 0 0
      0 0 0 0 0
      0 0 0 0 0
      
  
  Now you can defeat them all by casting a spell covers remaining one. Therefore
  you can cast "myonmyonmyon," which is the shortest spell for this case.
  
  You are given the information of the array. Please write a program that
  generates the shortest spell that can defeat them all.
samples: [{"input": "1 1 1 1 1\n    1 0 0 0 1\n    1 0 1 0 1\n    1 0 0 0 1\n    1 1 1 1 1\n    3\n    1 1 1\n    1 1 1\n    1 1 1\n    5\n    1 1 1 1 0\n    1 1 1 1 0\n    1 0 0 0 1\n    0 1 1 1 1\n    0 1 1 1 1\n    0", "output": "myonmyonmyon\n    myon\n    myonmyon"}]