AT_abc399_a [ABC399A] Hamming Distance

You are given a positive integer $ N $ and two strings $ S $ and $ T $ , each of length $ N $ and consisting of lowercase English letters. Find the Hamming distance between $ S $ and $ T $ . That is, find the number of integers $ i $ such that $ 1 \leq i \leq N $ and the $ i $ -th character of $ S $ is different from the $ i $ -th character of $ T $ .

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

Print the answer.

### Sample Explanation 1 $ S $ and $ T $ differ in the 2nd and 5th characters, but not in other characters. Thus, the answer is $ 2 $ . ### Constraints - $ 1\leq N \leq 100 $ - $ N $ is an integer. - Each of $ S $ and $ T $ is a string of length $ N $ consisting of lowercase English letters.