import com.sun.source.tree.Tree;

import java.util.*;
import java.util.stream.Collectors;

public class JustCount {


    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        String input = sc.nextLine();
        String inputArr[] = input.split("");


        TreeMap<Character, Integer> countLower = new TreeMap<>();
        TreeMap<Character, Integer> countUpper = new TreeMap<>();
        TreeMap<Character, Integer> countNonLetters = new TreeMap<>();
//        List<Character> lowerCaseLetters = new ArrayList<>();
//        List<Character> upperCaseLetters = new ArrayList<>();
//        List<Character> nonLetters = new ArrayList<>();
        boolean b1 = false;
        boolean b2 = false;


        for (int i = 0; i < inputArr.length; i++) {
            char symbol = inputArr[i].charAt(0);
            b1 = Character.isLowerCase(symbol);
            b2 = Character.isUpperCase(symbol);
            if (b1) {
                if (!countLower.containsKey(symbol)) {
                    countLower.put(symbol, 1);
                } else {
                    countLower.put(symbol, countLower.get(symbol) + 1);
                }
            } else if (b2) {
                if (!countUpper.containsKey(symbol)) {
                    countUpper.put(symbol, 1);
                } else {
                    countUpper.put(symbol, countUpper.get(symbol) + 1);
                }

            } else {
                if (!countNonLetters.containsKey(symbol)) {
                    countNonLetters.put(symbol, 1);
                } else {
                    countNonLetters.put(symbol, countNonLetters.get(symbol) + 1);
                }
            }
        }


        if (countNonLetters.size() == 0) {
            System.out.println("-");
        } else {
            int max = countNonLetters.values().stream().max(Integer::compare).get();
            for (var entry : countNonLetters.entrySet()) {
                if (entry.getValue() == max) {
                    char maxChar = entry.getKey();
                    System.out.print(maxChar + " ");
                    System.out.print(max);
                    System.out.println();
                    break;
                }
            }
        }


        if (countLower.size() == 0) {
            System.out.println("-");
        } else {
            int maxLower = countLower.values().stream().max(Integer::compare).get();
            for (var entry : countLower.entrySet()) {
                if (entry.getValue() == maxLower) {
                    char maxChar = entry.getKey();
                    System.out.print(maxChar + " ");
                    System.out.print(maxLower);
                    System.out.println();
                    break;
                }
            }
        }

        if (countUpper.size() == 0) {
            System.out.println("-");
        } else {
            int maxUpper = countUpper.values().stream().max(Integer::compare).get();
            for (var entry : countUpper.entrySet()) {
                if (entry.getValue() == maxUpper) {
                    char maxChar = entry.getKey();
                    System.out.print(maxChar + " ");
                    System.out.print(maxUpper);
                    break;
                }
            }
        }

    }

}