#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main()
{
  int na[26], nb[26];
  FOR(i,0,26) {
    na[i] = 0;
    nb[i] = 0;
  }
  string A, B;
  cin >> A >> B;
  FOR(i,0,A.length()) {
    na[A[i]-'a']++;
    nb[B[i]-'a']++;
  }
  FOR(i,0,26) {
    if(na[i]!=nb[i]) {
      puts("NO");
      return 0;
    }
  }
  puts("YES");
  return 0;
}