#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int N;
char *text;

bool suffixCompare( int a, int b ) {
	int i;
	for (i=0; (i<N - max(a,b)) &&
	     (text[a+i])==(text[b+i]); i++);
	if ( i == N - max(a,b) ) { return a>b; }
	else { return (text[a+i] < text[b+i]); }
}

int main() {
	int n;
	cin >> n;
	while (n--) {
		string input;
		cin >> input;
		text = const_cast<char*>(input.c_str());
		N = input.length();
		
		int *SA = new int[N];
		for (int i=0; i<input.length(); i++) {
			SA[i]=i;
		}
		std::sort(SA, SA+input.length(), suffixCompare);

		int maxStart=0; int maxLen=0; int maxFreq=0;
		for (int i=1; i<N; i++) {
			int k=0;
			for (; k<min(N-SA[i], N-SA[i-1]) && text[SA[i]+k]==text[SA[i-1]+k]; k++);
			if (k>maxLen) {
				maxLen = k;
				maxStart = SA[i];
			}
		}
		
		int lastPos=0;
		string s = input.substr(maxStart, maxLen);
		while ((lastPos=input.find(s,lastPos))!=string::npos) {
			maxFreq++;
			lastPos++;
		}
/*		// brute-force method - too slow!
		for (int i=0; i<input.length(); i++) {
			for (int j=maxLen+1; j+i<input.length(); j++) {
				string s = input.substr(i,j);
				
				int freq=0;
				int lastPos=0;
				while ((lastPos=input.find(s,lastPos))!=string::npos) {
					freq++;
					lastPos++;
				}
				if (freq>=2) {
					maxStart = i;
					maxLen = j;
					maxFreq = freq;
				}
			}
		}
*/		
		
		if (maxLen>0) {
			cout << input.substr(maxStart,maxLen) << " " << maxFreq << endl;
		} else {
			cout << "No repetitions found!" << endl;
		}
		
		delete[] SA;
	}
	
	return 0;
}