#include <iostream>
using namespace std;
int cmp(const void *a,const void *b)
{
    return (*(int *)a-*(int *)b);
}
int main()
{
    char a[101]={100},b[101]={100};//
    int count,count1[26]={0},count2[26]={0}; 
    int i,len;
    cin>>a>>b;
    len=strlen(a);
    for(i=0;i<len;i++){
        count1[a[i]-'A']++;
        count2[b[i]-'A']++;
    }
    qsort(count1,26,sizeof(int),cmp);
    qsort(count2,26,sizeof(int),cmp);
    
    for(i=0;i<26;i++)
        if(count1[i]!=count2[i])break;
    if(i==26)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
   // system("pause");
    return 0;
}