import javax.xml.transform.Result;import java.util.*;public class Main {//单词接龙public static void main(String[] args) {Scanner in = new Scanner(System.in);HashSet<String> set=new HashSet<>();//<单词,路径>HashMap<String, Integer> map =new HashMap<>();Deque<String> queue=new ArrayDeque<>();int n = in.nextInt();String begin =in.next();String end= in.next();for (int i = 0; i < n; i++) {set.add(in.next());}//存入起点queue.offer(begin);map.put(begin,1);//bfswhile (!queue.isEmpty()){String word =queue.poll();for (int i = 0; i < word.length(); i++) {StringBuilder sb=new StringBuilder(word);for (int j = 0; j < 26; j++) {sb.setCharAt(i, (char) ('a'+j));//newWord代表替换后的单词String newWord=sb.toString();//newWord是结果,收集并返回if (newWord.equals(end)){System.out.println(map.get(word)+1);return;}//newWord合法并且没有被访问过,存入队列和mapif (set.contains(newWord)&&!map.containsKey(newWord)){map.put(newWord,map.get(word)+1);queue.offer(newWord);}}}}System.out.println(0);}}