作者： Tozzger

// http://lx.lanqiao.cn/problem.page?gpid=T223

Scanner in = new Scanner(System.in);

String a = in.nextLine().toLowerCase();
String b = in.nextLine().toLowerCase();
int[] alp = new int[26];

for (char ch : a.toCharArray())
    alp[ch - 'a']++;
for (char ch : b.toCharArray())
    alp[ch - 'a']--;

boolean ret = true;
for (int i : alp) {
    if (i != 0) {
        ret = false;
        break;
    }
}

System.out.println(ret ? "Y" : "N");

// http://lx.lanqiao.cn/problem.page?gpid=T513

Scanner in = new Scanner(System.in);
long num = in.nextLong();
HashSet<Integer> set = new HashSet<>();

while (num > 1) {
    int i = 2;
    while (true) {
        if (num % i == 0) {
            set.add(i);
            num /= i;
            break;
        }
        i++;
    }
}

int ret = 1;
for (int i : set) {
    ret *= i;
}
System.out.println(ret);

// http://lx.lanqiao.cn/problem.page?gpid=T519
Scanner in = new Scanner(System.in);
int n = in.nextInt();// 学生数
int m = in.nextInt();// 图画数
int pattern = (1 << m) - 1;
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(n);
for (int i = 0; i < n; i++) {
    int num = 0;
    for (int j = 0; j < m; j++) {
        num <<= 1;
        if (in.nextInt() == 1) {
            num |= 1;
        }
    }
    map.merge(num, 1, Integer::sum);
}
int ret = 0;
for (Entry<Integer, Integer> e : map.entrySet()) {
    ret += e.getValue() * map.getOrDefault(~e.getKey() & pattern, 0);
}
System.out.println(ret / 2);

Scanner in = new Scanner(System.in);
int line = in.nextInt();
int[] arr = new int[line];
Arrays.fill(arr, 1);
for (int i = 0; i < line; i++) {
    for (int j = i - 1; j > 0; j--) {
        arr[j] += arr[j - 1];
    }
    for (int j = 0; j <= i; j++) {
        System.out.printf("%d ", arr[j]);
    }
    System.out.println();
}

    static Scanner in = new Scanner(System.in);

    public static void main(String[] args) {
        int leng = in.nextInt();
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < leng; i++) {
            map.putIfAbsent(in.nextInt(), i + 1);
        }
        System.out.println(map.getOrDefault(in.nextInt(), -1));
    }

for(int i = 10; i< 100; i++) {
    System.out.printf("%d%02d%n", i, (i % 10 * 10 + i / 10));
}

    static Scanner in = new Scanner(System.in);
    static String pattern = "ZYXWVUTSRQPONMLKJIHGFEDCBABCDEFGHIJKLMNOPQRSTUVWXYZ";

    public static void main(String[] args) {
        int line = in.nextInt(), col = in.nextInt();
        for(int i=0;i<line;i++) {
            System.out.println(pattern.substring(25 - i, 25 - i + col));
        }
    }

static int f(int num) {
    int fn1 = 1, fn2 = 1;
    while(num-- > 2) {
        // 原题要求如此，不需要的话把模删掉，再把返回类型换成更大的
        int fn = (fn1 + fn2) % 10007;
        fn2 = fn1;
        fn1 = fn;
    }
    return fn1;
}