// Arup Guha
// 3/13/2014
// Solution to 2014 FHSPS Playoff Problem: Twelve Years a Slave(twelve)

import java.util.*;

public class twelve {

	final public static int MOVIETIME = 134;

	public static int n;

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		n = stdin.nextInt();

		// Read in data.
		int[][] adj = new int[n][n];
		for (int i=0; i<n; i++)
			for (int j=0; j<n; j++)
				adj[i][j] = stdin.nextInt();

		// Run Floyd's.
		floyd(adj);

		int numQueries = stdin.nextInt();

		// Go through each query.
		for (int i=0; i<numQueries; i++) {

			// This query information.
			int s = stdin.nextInt();
			int e = stdin.nextInt();
			int maxTime = stdin.nextInt();

			int ans = 0;

			// Only loop through movie theaters as intermediate pts.
			for (int j=1; j<n; j+=2) {
				if (adj[s][j]+adj[j][e]+MOVIETIME <= maxTime)
					ans++;
			}

			// Here is the answer!
			System.out.println(ans);
		}
	}

	// Basic Floyd Warshall's. Overwrites original adjacency matrix.
	public static void floyd(int[][] adj) {
		for (int k=0; k<n; k++)
			for (int i=0; i<n; i++)
				for (int j=0; j<n; j++)
					adj[i][j] = Math.min(adj[i][j], adj[i][k]+adj[k][j]);
	}
}