You are given strings S and T consisting of lowercase English letters.

You can perform the following operation on S any number of times:

Operation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.

Determine if S and T can be made equal by performing the operation zero or more times.

Constraints

* 1 \leq |S| \leq 2 \times 10^5
* |S| = |T|
* S and T consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


S
T


Output

If S and T can be made equal, print `Yes`; otherwise, print `No`.

Examples

Input

azzel
apple


Output

Yes


Input

chokudai
redcoder


Output

No


Input

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu


Output

Yes
import java.io.File;
import java.io.IOException;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;
import java.util.Scanner;
 
public class Main {
 
	public static void main(String[] args) throws IOException {
		//File file = new File("input.txt");
		//Scanner sc = new Scanner(file);
		
		Scanner sc = new Scanner(System.in);
		
		String S = sc.next();
		String T = sc.next();
		HashMap<String, String> mapS = new HashMap<String, String>();
		HashMap<String, String> mapT = new HashMap<String, String>();
		boolean ans = true;
		
		for(int i = 0; i < S.length(); i++){
			String cs = "" + S.charAt(i);
			String ct = "" + T.charAt(i);
			
			if(mapS.containsKey(cs)){
				if(!ct.equals(mapS.get(cs))){
					ans = false;
					break;
				}
			}else mapS.put(cs, ct);
			
			if(mapT.containsKey(ct)){
				if(!cs.equals(mapT.get(ct))){
					ans = false;
					break;
				}
			}else mapT.put(ct, cs);
		}
		
		System.out.println(ans?"Yes":"No");
	}
}