AT_abc476_b [ABC476B] Wild Card

$ S $ is a string of length $ N $ consisting of lowercase English letters. $ T $ is a string of length $ N $ consisting of lowercase English letters and `*`. We say that $ S $ matches $ T $ if and only if $ T $ can be made equal to $ S $ by replacing each `*` in $ T $ with some lowercase English letter. Determine whether $ S $ matches $ T $ .

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

Output `Yes` if $ S $ matches $ T $ , and `No` otherwise, in one line.

### Sample Explanation 1 By replacing the first, second, fourth, and sixth characters of $ T $ , which are `*`, with `c`, `h`, `k`, and `d`, respectively, $ T $ can be made equal to $ S $ . ### Constraints - $ 1 \leq N \leq 100 $ - $ S $ is a string of length $ N $ consisting of lowercase English letters. - $ T $ is a string of length $ N $ consisting of lowercase English letters and `*`.