XOR and OR

The Bitlandians are quite weird people. They do everything differently. They have a different alphabet so they have a different definition for a string.

A Bitlandish string is a string made only of characters "0" and "1".

BitHaval (the mayor of Bitland) loves to play with Bitlandish strings. He takes some Bitlandish string a, and applies several (possibly zero) operations to it. In one operation the mayor may take any two adjacent characters of a string, define one of them as x and the other one as y. Then he calculates two values p and q: p = x xor y, q = x or y. Then he replaces one of the two taken characters by p and the other one by q.

The xor operation means the bitwise excluding OR operation. The or operation is the bitwise OR operation.

So for example one operation can transform string 11 to string 10 or to string 01. String 1 cannot be transformed into any other string.

You've got two Bitlandish strings a and b. Your task is to check if it is possible for BitHaval to transform string a to string b in several (possibly zero) described operations.

Input

The first line contains Bitlandish string a, the second line contains Bitlandish string b. The strings can have different lengths.

It is guaranteed that the given strings only consist of characters "0" and "1". The strings are not empty, their length doesn't exceed 10⁶.

Output

Print "YES" if a can be transformed into b, otherwise print "NO". Please do not print the quotes.

Example

Input

11
10

Output

YES

Input

1
01

Output

NO

Input

000
101

Output

NO

题意：给定两个01串，问A是否可以通过异或和或操作得到B串。

题解：1.全0状态只能停留在全0状态无法转换。

       2.有1状态不可能到全0状态。3.长度为1时，需特判。

Select Code

#include <string.h>
#include <stdio.h>
#define M 1000000+5
char a[M],b[M];
int main()
{
    int i,m,n;
    scanf("%s%s",a,b);
    m=strlen(a),n=strlen(b);
    if(!strcmp(a,b))
        puts("YES");
    else
       {
        if(m!=n)puts("NO");
        else
        {
            int flag1=0,flag2=0;
            for(i=0;i<m;i++)
            {
                if(a[i]=='1')
                {
                    flag1=1;
                    break;
                }
            }
            for(i=0;i<m;i++)
            {
            if(b[i]=='1')
                {
                    flag2=1;
                    break;
                }
            }
            if(flag1&&flag2) puts("YES");
            else puts("NO");
        }
       }
    return 0;
}