#include <iostream>
using namespace std;
int main()
{	
	int n,j=0,i=0,q=0,l=1,z=1,d=0,y=0,k;
	int a[100][100];
	int b[100][100];
	cout<<"請輸入數(shù)組的階數(shù):";
	cin>>n;
	cout<<"(數(shù)組元素只能為1或0)"<<endl;
	for(i=0;i<n;i++)
	{ 
		for(j=0;j<n;j++)
		{
			cout<<"請輸入第"<<i+1<<"行第"<<j+1<<"列的元素:";
			cin>>a[i][j];
			while(a[i][j]!=1&&a[i][j]!=0)
			{
				cout<<"只允許輸入1或0,請重新輸入第"<<i+1<<"行第"<<j+1<<"列的元素:";
				cin>>a[i][j];
			}
		}	
	}
	for(i=0;i<n;i++)
	{
		if(a[i][i]==0)
			q++;
	}//判斷自反
	for(i=1;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(a[i][j]!=a[j][i])
			{l=0;break;}
		}
	}//判斷對稱
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			b[i][j]=0;
			for(k=0;k<n;k++)
			{
				b[i][j]=a[i][k]*a[k][j]+b[i][j];
			}
		}
	}
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(b[i][j]==1)
			{
				if(a[i][j]==1)
				{
					d=d+1;
				}
			}
			
		}
	}//判斷傳遞
	for(i=0;i<n;i++)
	{ 
		for(j=0;j<n;j++)
		{
			cout<<a[i][j]<<" ";		
		}	
		cout<<endl;
	}
	
	if(q>0)
	{cout<<"不是自反"<<endl;}
	else 
	{cout<<"自反的";cout<<endl;}
	if(l==0)
	{cout<<"不是對稱的";cout<<endl;}
	else 
	{cout<<"對稱的";cout<<endl;}
	if(d>0){cout<<"傳遞"<<endl;}
	else {cout<<"不傳遞"<<endl;}
	return 0;
}