Given:

two *binary* strings **x** and **y** of the same length; reorder the characters of **x** in an `arbitrary` way and reorder the characters of **y** also in an `arbitrary` *(not necessarily the same)* way. 

What is the total number of distinct XOR obtained?

Note:

```
if x = 1 and y = 11 in binary then take x = 01 So,that length of x and y are equal

```

Example:

```
if x = 0 and y = 10 

```

then possible outcomes is 2 that is 2 distinct XOR are possible

```
"00" XOR "10" is "10"
"00" XOR "01" is "01"
"00" XOR "10" is "10"
"00" XOR "01" is "01"

```