// Problem: G - Bigram Language Model
// Contest: Virtual Judge - Namomo Summer Camp 23 Day 3
// URL: https://vjudge.net/contest/577185#problem/G
// Memory Limit: 254 MB
// Time Limit: 5000 ms

#include <bits/stdc++.h>
using namespace std;

// 2023 OneWan
map<pair<string, string>, int> mp1;
map<string, int> mp2;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	for (int i = 0 ; i < n ; i++) {
		int m;
		cin >> m;
		string last, str;
		for (int j = 0 ; j < m ; j++) {
			cin >> str;
			if (j > 0) {
				mp1[{last, str}]++;
				mp2[last]++;
			}
			last = str;
		}
	}
	int q;
	cin >> q;
	while (q--) {
		string a, b;
		cin >> a >> b;
		if (mp2.count(a)) {
			int cnt1 = 0, cnt2 = mp2[a];
			if (mp1.count({a, b})) {
				cnt1 = mp1[{a, b}];
			} 
			int d = __gcd(cnt1, cnt2);
			cnt1 /= d;
			cnt2 /= d;
			cout << cnt1 << "/" << cnt2;
		} else {
			cout << "Insufficient data";
		}
		cout << "\n";
	}
	return 0;
}