Data Transmission

Data is sent from a transmitter to a receiver over a communication channel as a sequence of bits. The channel may distort the sequence during transmission, so the sequence $t$ received by the receiver can differ from the sequence $s$ sent by the transmitter. One type of distortion is the swap of two adjacent bits. In this case, $s$ and $t$ differ at exactly two adjacent positions $i$ and $i+1$, where $s_i = t_{i+1}$ and $s_{i+1} = t_i$, and $s_j = t_j$ for every $j$ other than $i$ and $i+1$.

You are a researcher working on information transmission. You are designing a coding scheme for an important government channel. The code must be able to correct one adjacent bit swap. To assess the channel's reliability, the test works as follows. Several bit sequences $s_1, s_2, \ldots, s_n$ are sent, the received sequences $t_1, t_2, \ldots, t_n$ are stored, and then they are compared with what was sent. The reliability is judged by the fraction of sequences that arrived without distortion or with a single adjacent swap.

Comparing the sequences by hand is too laborious because they are long. Write a program that, given two sequences $s$ and $t$, determines whether $t$ can be obtained from $s$ by performing at most one swap of adjacent symbols.

The first line contains the sequence $s$, and the second line contains the sequence $t$. Both sequences are non-empty, consist only of 0 and 1, and have length at most 100000.

Print YES if $t$ can be obtained from $s$ in the way described above. Otherwise, print NO.