static int det(int[][] a)
	{	if(a.length == 2)
		{
			return (a[0][0]*a[1][1])-(a[0][1]*a[1][0]);
		}

		int det = 0;
		for(int i = 0; i<a.length; i++)
		{
			det += a[0][i]*det(del(a,0,i));
		}

		return det;
	}


	static int[][] del(int[][]a, int i, int j)
	{
		int[][] n = new int[a.length-1][a.length-1];
		for(int f = 0; f<a.length-1; f++)
			for(int g = 0; g<a.length-1; g++)
		{
			{
				n[f][g] =
			}
		}


		return n;
	}