#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

struct node
{
	double weight;
	int next;
	int to;
}edge[N * N];

double dist[N];
int head[N];
int tot, n;

void addedge(int from, int to, double weight)
{
	edge[tot].weight = weight;
	edge[tot].to = to;
	edge[tot].next = head[from];
	head[from] = tot++;
}

void spfa(int v0)
{
	for (int i = 1; i <= n; i++)
	{
		dist[i] = 0.000;
	}
	dist[v0] = 1.000;
	queue <int> qu;
	while ( !qu.empty() )
	{
		qu.pop();
	}
	qu.push(v0);
	while ( !qu.empty() )
	{
		int u = qu.front();
		qu.pop();
		for (int i = head[u]; ~i; i = edge[i].next)
		{
			int v = edge[i].to;
//			printf("%.3f %.3f\n", dist[v], dist[u] * edge[i].weight);
			if (dist[v] < dist[u] * edge[i].weight)
			{
				dist[v] = dist[u] * edge[i].weight;
				qu.push(v);
			}
		}
	}
}

int main()
{
	while (~scanf("%d", &n))
	{
		double w;
		int u, v;
		memset (head, -1, sizeof(head) );
		tot = 0;
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				scanf("%lf", &w);
				addedge(i, j, w);
			}
		}
		int m;
		scanf("%d", &m);
		while (m--)
		{
			scanf("%d%d", &u, &v);
			spfa(u);
			if (dist[v] != 0)
			{
				printf("%.3lf\n", dist[v]);
				continue;
			}
			printf("What a pity!\n");
		}
	}
	return 0;
}