import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

public class trieAgain {
	private String isTree(String tree, int n) {
		int count = 0;
		for (int i = n; i < tree.length()-1; i++) {
			if (tree.charAt(i) == '#') {
				count++;
			} else {
				count--;
			}
			if (count == 1) {
				if(valid(tree.substring(n,i+1))){
					return tree.substring(n, i+1);
				}
			}
		}
		return "";
	}
	private boolean valid(String substring) {
		boolean done = false;
		for(int i = 0;i<substring.length();i++){
			char cur = substring.charAt(i);
			if(cur == '#'){
				done = true;
			} else if (cur != '#' && done == true){
				return false;
			} else if(cur== '@'){
				return false;
			}
		}
		return true;
	}
	private void go(ArrayList<String> trees) {
		for (int i = 0; i < trees.size(); i++) {
			HashMap<String, Integer> maxTree = new HashMap<String, Integer>();
			for (int j = 0; j < trees.get(i).length(); j++) {
				if (trees.get(i).charAt(j) != '#'&&trees.get(i).charAt(j)!='@') {
					String tree = isTree(trees.get(i), j);
					if (tree.length() > 0) {
						if (maxTree.containsKey(tree)) {
							int c = maxTree.get(tree);
							maxTree.put(tree, c+=1);
						} else {
							maxTree.put(tree, 1);
						}
					}
				}
			}
			String ans = "";
			int maxScore = 1;
			for (String s : maxTree.keySet()) {
				int numChars = countChars(s);
				if (maxTree.get(s)*(numChars-1) > maxScore) {
					maxScore = maxTree.get(s)*(numChars-1);
					ans = s;
				} else if(maxTree.get(s)*(numChars-1) == maxScore){
					if(numChars<countChars(ans)){
						ans = s;
					}
				}
			}
			System.out.println(ans + " " + Integer.toString(maxScore));
		}
	}

	private int countChars(String s) {
		// TODO Auto-generated method stub
		int count = 0;
		for(char c:s.toCharArray()){
			if(c!='#'){
				count+=1;
			}
		}
		return count;
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String entry = in.next();
		int count = 0;
		ArrayList<String> trees = new ArrayList<String>();
		while(!entry.equals("END")){
			trees.add(entry);
			entry = in.next();
		}
		trieAgain inst = new trieAgain();
		inst.go(trees);

	}

}