Untitled

s = input() 
t = input() 
def brute_force(s,t):
    return sorted(s) == sorted(t) 
##optimisation using 2 hashmaps 
from collections import defaultdict 
def optimal_solve(s,t):
    m1 = defaultdict(int)  
    m2 = defaultdict(int)  
    if len(s) != len(t):
        return False 
    for char in s:
        m1[char] += 1 
    for char in t:
        m2[char] += 1 
    for i in range(len(s)):
        if m1[s[i]] != m2[s2[i]]:
            return False 
    return True 
##Optimisation 2 using the single hashmap 
def optimsiation 2(s,t):
    mp = defaultdict(int) 
    for char in s:
        m1[char] += 1 
    for char in t:
        m1[char] -= 1 
    for i in m1.values():
        if i != 0:
            return False 
    return True