package Mi.Exam1; import java.util.ArrayList; import java.util.HashMap; import java.util.Scanner; class StrNum{ String s; int value; public StrNum(int value, String s) { this.s = s; this.value = value; } } public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); ArrayList<StrNum> list = new ArrayList<>(); HashMap<Integer,Integer> map = new HashMap<>(); while(in.hasNext()) { String str = in.nextLine(); if(!str.equals("END")) { String[] num = str.split("#"); int n = Integer.parseInt(num[0]); int value = Integer.parseInt(num[1], n); StrNum temp = new StrNum(value, str); map.put(value, map.containsKey(value) ? map.get(value)+1 : 1); list.add(temp); } else { break; } } in.close(); boolean isExist = false; for(StrNum strNum : list) { if(map.get(strNum.value) == 1) { isExist = true; System.out.println(strNum.s); } } if(!isExist) { System.out.println("None"); } } }