package StringAndTextProcessing.Exercises;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedHashMap;
import java.util.Map;

public class MagicExchangableWords {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

        String[] words = reader.readLine().split(" ");
        String first = words[0];
        String second = words[1];

        Map<Character, Character> letters = new LinkedHashMap<>();

        int counter = 0;
        for (int i = 0; i < first.length(); i++) {
            char current = first.charAt(i);
            if (!letters.containsKey(current)) {
                letters.put(current, second.charAt(i));
                counter++;
                continue;
            }
            if (letters.get(current).equals(second.charAt(i))) {
                counter++;
            }

        }

        if (counter == first.length()){
            System.out.println("true");
        } else {
            System.out.println("false");
        }

    }
}