import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;

public class Rookie4
{
	public static void main(String []args)
	{
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int d = n-1;
		int [][]hj = new int[d][d];
		NodeKnight hh = new NodeKnight();
		for(int i=1;i<n;i++)
		{
			for(int j=1;j<n;j++)
			{
				if(hj[i-1][j-1]==0)
				{
					HashSet<NodeKnight> h = new HashSet<NodeKnight>();

					KnightL(h,d,d,i,j,n,n);
					int count = 1;
					int k = 0;
					HashSet<NodeKnight> hs = new HashSet<NodeKnight>();
					while(count!=-1&&!h.contains(hh))
					{
						HashSet<NodeKnight> h1 = new HashSet<NodeKnight>();
						HashSet<NodeKnight> h2 = new HashSet<NodeKnight>();
						Iterator<NodeKnight> itr = h.iterator();
						
						hh.x=0;
						hh.y= 0 ;
						while(itr.hasNext())
						{
							NodeKnight sum = itr.next();
							int x = sum.x;
							int y = sum.y;
							hs.add(sum);
							KnightL(h1,x,y,i,j,n,n);
							if(h1.contains(hh))
							{
								count++;
								break;
							}
						}
//						itr = h.iterator();
//						while(itr.hasNext())
//						{
//							NodeKnight rr = itr.next();
//							System.out.print(rr.x+" "+rr.y);
//						}
//						System.out.println();
//						itr = h1.iterator();
//						while(itr.hasNext())
//						{
//							NodeKnight rr = itr.next();
//							System.out.print(rr.x+" "+rr.y);
//						}
//						System.out.println();
//						itr = hs.iterator();
//						while(itr.hasNext())
//						{
//							NodeKnight rr = itr.next();
//							System.out.print(rr.x+" "+rr.y);
//						}
//						System.out.println();
						if(h1.contains(hh))
						{
							break;
						}
						else if(h1.size()==0)
						{
							count=-1;
							break;
						}
						else
						{
							h.clear();
							h1.removeAll(hs);
							h.addAll(h1);
							count++;
							//System.out.println(">>>>"+h.size());
						}
//						itr = h.iterator();
//						while(itr.hasNext())
//						{
//							NodeKnight rr = itr.next();
//							System.out.print(rr.x+" "+rr.y);
//						}
//						System.out.println();

					}
//					System.out.println();
//					System.out.println(count);
					hj[i-1][j-1]=count;
					hj[j-1][i-1]=count;

				}
				
			}
		}

				for(int i=0;i<d;i++)
				{
					for(int j=0;j<d;j++)
					{
						System.out.print(hj[i][j]+ " ");
					}
					System.out.println();
				}
	}
	private static HashSet KnightL(HashSet h,int x,int y,int i,int j,int xs,int ys)
	{	//System.out.println("x : "+x+"y : "+y);
	
	int xp = x+i;
	int xn = x-i;
	int yp = y+j;
	int yn = y-j;
	int xpr = x+j;
	int xnr = x-j;
	int ypr = y +i;
	int ynr = y-i;
	//System.out.println(xn+" "+yp);
	if(xp<xs&&xp>=0)
	{
		if(yp<ys&&yp>=0)
		{
			NodeKnight k = new NodeKnight();
			k.x = xp;
			k.y = yp;
			h.add(k);
		}
		if(yn>=0&&yn<ys)
		{
			NodeKnight k = new NodeKnight();
			k.x = xp;
			k.y = yn;
			h.add(k);
		}
	}
	if(xn>=0&&xn<xs)
	{
		if(yp<ys&&yp>=0)
		{
			NodeKnight k = new NodeKnight();
			//System.out.println(">>>>>>>>>>");
			k.x = xn;
			k.y = yp;
			h.add(k);
		}
		if(yn>=0&&yn<ys)
		{
			NodeKnight k = new NodeKnight();
			k.x = xn;
			k.y = yn;
			h.add(k);
		}
	}
	if(xpr<xs&&xpr>=0)
	{
		if(ypr<ys&&ypr>=0)
		{
			NodeKnight k = new NodeKnight();
			k.x = xpr;
			k.y = ypr;
			h.add(k);	
		}
		if(ynr>=0&&ynr<ys)
		{
			NodeKnight k = new NodeKnight();
			k.x = xpr;
			k.y = ynr;
			h.add(k);
		}
	}
	if(xnr>=0&&xnr<xs)
	{
		if(ypr<ys&&ypr>=0)
		{
			NodeKnight k = new NodeKnight();
			k.x = xnr;
			k.y = ypr;
			h.add(k);
		}
		if(ynr>=0&&ynr<ys)
		{
			NodeKnight k = new NodeKnight();
			k.x = xnr;
			k.y = ynr;
			h.add(k);
		}
	}


	return h;
	}

}

class NodeKnight
{
	int x;
	int y;
	public NodeKnight()
	{
		x=-1;
		y=-1;
	}
	public boolean equals(Object obj) {
        if (!(obj instanceof NodeKnight)) {
            return false;
        }
        NodeKnight other = (NodeKnight)obj;
        if (x != other.x)
            return false;
        if (y != other.y)
            return false;
        return true;
    }
	
	public int hashCode() {
       
		final int prime = 31;
	    int result = 1;
	    result = prime * result + x;
	    result = prime * result + y;
	    return result;
    }

}