MinMax

import java.util.Comparator;
import java.util.Scanner;


class MinMax<T extends Comparable<T>>{

    private T min;
    private T max;
    private int swappedMin;
    private int swappedMax;
    private int swappedTotal;

    public MinMax(){
        swappedTotal = 0;
        swappedMin = 0;
        swappedMax = 0;
        min = null;
        max = null;
    }
    public void update(T element){
       swappedTotal++;
       if (min == null&&max == null){
                min = element;
                max = element;
       }

        if (min.compareTo(element) > 0){
            min = element;
            swappedMin = 0;
        }
        if (max.compareTo(element) < 0){
            max = element;
            swappedMax = 0;
        }

        if(max.compareTo(element)==0){
            swappedMax++;
        }
        if(min.compareTo(element)==0) {
            swappedMin++;
        }



    }
    public T max(){
        return max;
    }
    public T min(){
        return min;
    }

    @Override
    public String toString() {
        return min + " " + max + " " + (swappedTotal-(swappedMax+swappedMin)) + "\n";
    }
}





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);
    }
}