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++)
		{
			if(i%2==0)
			{
				det += a[0][i]*det(del(a,0,i));
			}
			else
			{
				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];

		int k = 0;
		for(int f = 0; f<n.length; f++)
		{
			int l = 0;
			for(int g = 0; g<n.length; g++)
			{
				if(k != i && l != j)
				{
					n[f][g] = a[k][l];
				}
				l++;
			}
			k++;
		}
		return n;
	}