/*

@theme:poj 2159 ancient cipher

@writer:pprp

@declare:

@begin:19:20

@end:20:07

@date:2017/8/31

*/

#include <iostream>

#include <algorithm>

#include <cstdio>

using namespace std;

int main()

{

    //freopen("in.txt","r",stdin);

    ios::sync_with_stdio(false);

    int a[] = {};

    int b[] = {};

    string str1, str2;

    cin >> str1 >> str2;

    for(int i =  ; i < str1.length() ; i++)

        a[str1[i] - 'A']++;

    for(int i =  ;i < str2.length() ; i++)

        b[str2[i] - 'A']++;

    sort(a,a+);

    sort(b,b+);

    int i;

    for(i =  ; i <  ; i++)

        if(a[i] != b[i])

        break;

    if(i !=  )

        cout << "NO" << endl;

    else

        cout << "YES" << endl;

    return ;

}