import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;


public class Trie {

	Scanner in = new Scanner(System.in);
	Map<Integer, TreeNode> myMap = new TreeMap<Integer, TreeNode>();

	public class TreeNode{
		char value; 
		TreeNode leftChild; 
		TreeNode rightChild; 
		TreeNode parent; 
		boolean complete;

		public TreeNode(char c){
			value=c;
			complete=false;
		}
	}

	public void go(){
		List<String> trees = new ArrayList<String>(); 
		String s ="";
		while (true){
			s = in.nextLine();
			if (s.equals("END")){break;}
			trees.add(s);
		}
		for (int i=0; i<trees.size(); i++){
			TreeNode t = makeTreeFromString(trees.get(i));
			String trie = trees.get(i);
			Map<String, Integer> counts = new TreeMap<String, Integer>();
			for (int j=0; j<trie.length(); j++){
				if (trie.charAt(j)!='#'){
					String sub = findSubtree(myMap.get(j));
					int num = countOccurences(sub, trie);
					counts.put(sub, num);

				}
			}

			int max =0; 
			for (Map.Entry<String, Integer> entry: counts.entrySet()){
				int numNodes = 0;
				for (int k=0; k<entry.getKey().length(); k++){
					if (entry.getKey().charAt(k)!='#'){numNodes++;}
				}
				int c = numNodes * (entry.getValue()-1);
				if (c>max){max=c;}
			}
			List<String> solutions = new ArrayList<String>();
			for (Map.Entry<String, Integer> entry: counts.entrySet()){
				int numNodes = 0;
				for (int k=0; k<entry.getKey().length(); k++){
					if (entry.getKey().charAt(k)!='#'){numNodes++;}
				}
				int c = numNodes * (entry.getValue()-1);
				if (c==max){
					solutions.add(entry.getKey());}
			}
			if (solutions.size()==1){
				int numNodes=0;
				for (int k=0; k<solutions.get(0).length(); k++){
					if (solutions.get(0).charAt(k)!='#'){numNodes++;}
				}
				int c = numNodes * (counts.get(solutions.get(0))-1);
				System.out.println(solutions.get(0)+" "+c);
			}
			else{
				List<String> sol2 = new ArrayList<String>();
				int minLength=Integer.MAX_VALUE;
				//				for (int k=0; k<solutions.size();k++){
				//					int numNodes=0;
				//					for (int l=0; l<solutions.get(k).length(); l++){
				//						if (solutions.get(k).charAt(l)!='#'){numNodes++;}
				//					}
				//					if (numNodes<minLength){
				//						minLength=numNodes;
				//					}
				//				}
				for (int k=0; k<solutions.size();k++){
					if (solutions.get(k).length()<minLength){
						minLength=solutions.get(k).length();
					}
				}
				for (int k=0; k<solutions.size();k++){
					//					int numNodes=0;
					//					for (int l=0; l<solutions.get(k).length(); l++){
					//						if (solutions.get(k).charAt(l)!='#'){numNodes++;}
					//					}
					//					if (numNodes==minLength){
					//						sol2.add(solutions.get(k));
					//					}
					if (solutions.get(k).length()==minLength){
						sol2.add(solutions.get(k));
					}
				}
				if (sol2.size()==1){
					int numNodes=0;
					for (int l=0; l<sol2.get(0).length(); l++){
						if (sol2.get(0).charAt(l)!='#'){numNodes++;}
					}
					int c = numNodes * (counts.get(sol2.get(0))-1);
					System.out.println(sol2.get(0)+" "+c);
				}
				else{
					int min=Integer.MAX_VALUE;
					for (int l=0;l<sol2.size();l++){
						if (counts.get(sol2.get(l))<min){
							min=counts.get(sol2.get(l));
						}
					}
					for (int m=0;m<sol2.size();m++){
						if (counts.get(sol2.get(m))==min){
							int numNodes=0;
							for (int l=0; l<sol2.get(m).length(); l++){
								if (sol2.get(m).charAt(l)!='#'){numNodes++;}
							}
							int c = numNodes * (counts.get(sol2.get(m))-1);
							System.out.println(sol2.get(m)+" "+c);
						}
					}
				}
			}


		}
	}

	public int countOccurences(String one, String two){
		int occurs = 0;
		for (int i=0; i<(two.length()-one.length())+1; i++){
			if (two.substring(i, i+one.length()).equals(one)){
				occurs++;
			}
		}
		return occurs;
	}


	public int getLevel(TreeNode t, TreeNode r, int levelCount){
		if (t==null){return 0;}
		if (t.equals(r)){return levelCount;}

		int level=0;
		if (r.leftChild!=null){level+=getLevel(t,r.leftChild, levelCount+1);}
		if (r.rightChild!=null){level+=getLevel(t,r.rightChild, levelCount+1);}

		return level;
	}

	public int getHeight(TreeNode t){
		if (t==null){return 0;}
		return Math.max(getHeight(t.rightChild), getHeight(t.leftChild))+1;

	}

	public TreeNode makeTreeFromString(String s){
		int i=0; 
		TreeNode root = new TreeNode(s.charAt(i));
		root.parent=null;
		myMap.put(0, root);
		fromRoot(s, 0, root, true);
		//printTree(root);

		return root;
	}

	public void printTree(TreeNode t){
		if (t.leftChild!=null){
			System.out.println("The left child of " + t.value + " is " + t.leftChild.value);
			printTree(t.leftChild);
		}
		if (t.rightChild!=null){
			System.out.println("The right child of " + t.value + " is " + t.rightChild.value);
			printTree(t.rightChild);
		}
	}

	public void fromRoot(String s, int i, TreeNode t, boolean left){
		if (i>=s.length()-1){return;}
		char c = s.charAt(i+1);
		if (t.complete && t.parent==null){return;}
		if (t.complete){fromRoot(s, i, t.parent, left);}
		else if (c=='#' && left){
			t.leftChild=null;
			fromRoot(s, i+1, t, false);}
		else if(c=='#' &&!left){
			t.rightChild = null; 
			t.complete=true;
			fromRoot(s, i+1, t.parent, false);
		}
		else if(left){
			t.leftChild = new TreeNode(c);
			myMap.put(i+1, t.leftChild);
			t.leftChild.parent = t;
			fromRoot(s, i+1, t.leftChild, true);
		}
		else{
			t.rightChild = new TreeNode(c);
			myMap.put(i+1, t.rightChild);
			t.rightChild.parent = t; 
			t.complete=true;
			fromRoot(s, i+1, t.rightChild, true);
		}
	}

	public String findSubtree(TreeNode t){
		if (t==null){return "#";}
		char sub = t.value;

		return sub + findSubtree(t.leftChild) + findSubtree(t.rightChild);


	}


	//	public String findSubtree(String s, int i){
	//		TreeNode t = myMap.get(i);
	//		int firstLevel = getLevel(t, myMap.get(0), 1);
	//		for (int j=0; j<s.length(); j++){
	//			if (s.charAt(j)!='#'){
	//				TreeNode n = myMap.get(j);
	//				int secondLevel = getLevel(n, myMap.get(0), 1);
	//				if (firstLevel>=secondLevel && !t.equals(n) && j>i){
	//					return s.substring(i, j);
	//				}
	//			}
	//		}
	//
	//		return s;
	//
	//	}


	public static void main(String[] args){
		Trie t = new Trie();
		t.go();
	}

}