import java.util.*;

public class DictionaryMatch {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        try {
            // validate first input
            if (!sc.hasNextInt()) {
                System.out.println("Invalid input");
                return;
            }

            int n = sc.nextInt();

            // handle negative n
            if (n < 0) {
                System.out.println("-1");
                System.out.println("-1");
                return;
            }

            String[] words = new String[n];
            for (int i = 0; i < n; i++) {
                words[i] = sc.next();
            }

            String prefix = sc.next();
            String suffix = sc.next();

            int prefixSuffixIndex = -1;
            int longestIndex = -1;
            int maxLength = -1;

            for (int i = 0; i < n; i++) {
                String word = words[i];

                // prefix+suffix check → last occurrence
                if (word.startsWith(prefix) && word.endsWith(suffix)) {
                    prefixSuffixIndex = i;
                }

                // longest word → first occurrence only
                if (word.length() > maxLength) {
                    maxLength = word.length();
                    longestIndex = i;
                }
            }

            // if no prefix-suffix match, return -1
            System.out.println(prefixSuffixIndex);
            System.out.println(longestIndex);

        } catch (Exception e) {
            System.out.println("Invalid input");
        }
    }
}