import java.security.KeyStore.Entry;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.Map;

public class May26 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String[] input = scan.nextLine().split(" ");
        int[] n = new int[input.length];
        int all =0;
        for (int i = 0; i < input.length; i++) {
            n[i] = Integer.parseInt(input[i]);

        }
        // key //value
        LinkedHashMap<String, Integer> array = new LinkedHashMap<>();
if (n.length == 2) {
    System.out.println(n[0]+" "+n[1]+" -> 100.00%" );
    return;
}
        for (int i = 0; i < n.length-1; i++) {
            for (int j = 1;j < n.length-1; j++) {
                /*
                 * if (n[i]==n[j] && n[i+1] == n[j+1]) {
                 *
                 * }
                 */
                int[] k = new int[2];
                k[0] = n[i];
                k[1] = n[i + 1];
                String y = k[0] + " " + k[1];
                if (array.containsKey(y)) {
                    int a = array.get(y);
                    array.put(y, a + 1);
                    all++;
                } else {
                    array.put(y, 1);
                    all++;
                }

            }
        }
        int sum = 0;
        int b = 0;
        for (java.util.Map.Entry<String, Integer> entry: array.entrySet()) {
            b =entry.getValue();
            sum+=b;
            double percent = (100.00/all*b);
            String ans = entry.getKey();
            System.out.printf("%s -> %.2f%s \n", ans, percent,"%");

            //3 4 -> 30.00%
        }


    }
}