import java.io.*;
import java.util.*;

public class moduic_inaba
{
	public static void main( String[] _ ) throws IOException
	{
		StreamTokenizer st =
			new StreamTokenizer(
				new BufferedReader(
					new InputStreamReader(System.in)));

		for(;;) {
			int[] filled = new int[10];
			for(int i=0; i<10; ++i) {
				st.nextToken();
				filled[i] = (int) st.nval;
				if( filled[i] < 0 )
					return; // 入力の終わり
			}
			System.out.println( count(filled) );
		}
	}

	static int count( int[] sq )
	{
		boolean[] used = new boolean[11];
		for(int i=0; i<sq.length; ++i)
			if( sq[i] != 0 )
				used[sq[i]] = true;
		return rec(0, sq, used);
	}

	static int rec(int i, int[] sq, boolean[] used)
	{
		if( i == 10 ) {
			int a = (sq[0] + sq[1] + sq[2]) % sq[9];
			int b = (sq[3] + sq[4] + sq[5]) % sq[9];
			int c = (sq[6] + sq[7] + sq[8]) % sq[9];
			int d = (sq[0] + sq[3] + sq[6]) % sq[9];
			int e = (sq[1] + sq[4] + sq[7]) % sq[9];
			int f = (sq[2] + sq[5] + sq[8]) % sq[9];
			int g = (sq[0] + sq[4] + sq[8]) % sq[9];
			int h = (sq[2] + sq[4] + sq[6]) % sq[9];
			return (a==b && a==c && a==d && a==e && a==f && a==g && a==h ? 1 : 0);
		} else if( sq[i] != 0 ) {
			return rec(i+1, sq, used);
		} else {
			int cnt = 0;
			for(int k=1; k<=10; ++k)
				if( !used[k] ) {
					used[k] = true;
					sq[i] = k;
					cnt += rec(i+1, sq, used);
					sq[i] = 0;
					used[k] = false;
				}
			return cnt;
		}
	}
}