import java.util.Scanner;

class MinMax<T extends Comparable<T>>{

    private T min;
    private T max;
    private int s;
    private int minCount;
    private int maxCount;

    public MinMax(){
        min = null;
        max = null;
        s=0;
        minCount = 0;
        maxCount = 0;
    }

    public void update(T element){

        if(min == null&&max == null)
        {
            min = element;
            max = element;

            minCount++;
            maxCount++;
            s++;
        }
        else{
            s++;

            if(element.equals(max))
                maxCount++;

            if(element.equals(min))
              minCount++;

        if(element.compareTo(max) > 0){
        maxCount = 1;
        max = element;
        }

        if(element.compareTo(min) < 0){
            minCount = 1;
            min = element;
        }
        }


    }

    public T max(){
        return max;
    }

    public T min(){
        return min;
    }

    @Override
    public String toString() {
    StringBuilder sb = new StringBuilder();

    sb.append(min+" ");
    sb.append(max+" ");
    sb.append(s-minCount-maxCount);
    sb.append("\n");
    return sb.toString();
    }
}


public class MinAndMax {
    public static void main(String[] args) throws ClassNotFoundException {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        MinMax<String> strings = new MinMax<String>();
        for(int i = 0; i < n; ++i) {
            String s = scanner.next();
            strings.update(s);
        }
        System.out.println(strings);
        MinMax<Integer> ints = new MinMax<Integer>();
        for(int i = 0; i < n; ++i) {
            int x = scanner.nextInt();
            ints.update(x);
        }
        System.out.println(ints);
    }
}