import java.util.*; public class Main { static long gcd(long a,long b){ return b == 0 ? a : gcd(b, a%b); } static long lcm(long a, long b){ return a*b/gcd(a, b); } public static void main(String[] args) { Scanner sc = new Scanner(System.in); HashMap last = new HashMap<>(); int n = sc.nextInt(); int[] a = new int[n]; for(int i=0;i s = new PriorityQueue<>((x,y)->y-x); StringBuilder ans = new StringBuilder(); for(int i=0;i