AT_abc409_a [ABC409A] Conflict

There are $ N $ items. You are given strings $ T $ and $ A $ of length $ N $ that represent which items Takahashi and Aoki want, respectively. Let $ T_i $ and $ A_i $ be the $ i $ -th $ (1\leq i\leq N) $ characters of $ T $ and $ A $ , respectively. Takahashi wants the $ i $ -th item when $ T_i $ is `o`, and does not want the $ i $ -th item when $ T_i $ is `x`. Similarly, Aoki wants the $ i $ -th item when $ A_i $ is `o`, and does not want the $ i $ -th item when $ A_i $ is `x`. Determine whether there exists an item that both of them want.

The input is given from Standard Input in the following format: > $ N $ $ T $ $ A $

If there exists an item that both of them want, output `Yes`; otherwise, output `No`.

### Sample Explanation 1 The third item is wanted by both of them, so output `Yes`. ### Sample Explanation 2 There is no item that both of them want, so output `No`. ### Constraints - $ 1\leq N\leq 100 $ - $ N $ is an integer. - $ T $ and $ A $ are strings of length $ N $ consisting of `o` and `x`.