#include <iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const char *s="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int maxn=26;
int a[maxn],b[maxn];
string maze;
string org;
int main()
{
    cin>>maze>>org;
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    if(maze.length()!=org.length()) printf("NO\n");
    else {
                for(int i=0;i<maxn;i++)
                {
                    for(int j=0;j<org.length();j++)
                    {
                        if(s[i]==org[j]) a[i]++;
                        if(s[i]==maze[j]) b[i]++;
                    }
                }
                sort(a,a+maxn);
                sort(b,b+maxn);
                int t=1;
                for(int i=0;i<maxn;i++)
                     if(a[i]!=b[i]) {
                                       t=0;
                                       break;
                                      }
                if(t) printf("YES\n");
                else printf("NO\n");
           }
    return 0;
}