#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define REP(i,n) for(int i=0;i<(n);++i)
#define SORT(a) sort((a).begin(),(a).end())
#define PB push_back
using namespace std;
typedef vector<int> VI;

int main(){
  string A, B;
  cin >> A >> B;
  int c[26] = {}, d[26] = {};
  int l = A.size();
  REP(i,l){
    c[A[i] - 'a']++;
    d[B[i] - 'a']++;
  }
  int r = 1;
  REP(i,26){
    if(c[i] != d[i]){ r = 0; }
  }
  cout << (r ? "YES" : "NO") << endl;
}