Taco

You are given two strings t and s. Your task is to determine whether the target word t can be potentially formed by reordering and transforming the characters in the source word s. In this problem, a valid transformation is defined simply as having the same number of characters: if the lengths of t and s are equal, then the transformation is considered possible (even though the actual characters may differ).

In mathematical notation, let \( |t| \) and \( |s| \) denote the lengths of strings \( t \) and \( s \), respectively. Then the answer is "Yes" if and only if

[ |t| = |s| ]

Otherwise, output "No".

Note: Even if the characters in the two strings are completely different, as long as the lengths match, the answer is "Yes".

inputFormat

The input consists of two lines. The first line contains the target string t and the second line contains the source string s. Both strings may consist of any printable characters and their lengths can be zero.

outputFormat

Output a single line: "Yes" if the length of t is equal to the length of s; otherwise, output "No".

abc

def

Yes