You are given two strings s and t of lowercase letters. They are one edit apart when you can turn s into t using exactly one of the following operations:
- insert a single character,
- delete a single character,
- replace a single character with a different one.
Two identical strings are NOT one edit apart (that would take zero edits).
Input format
Line 1: the string s (possibly empty).
Line 2: the string t (possibly empty).
Output format
Print YES if s and t are exactly one edit apart, otherwise print NO.
Constraints
- 0 <= length of each string <= 200000
- Each string contains only lowercase letters
a-z.