Minimum Operations to Transform Strings

You are given two strings s and t of equal length n. In one operation, you can change a single character in s to any other character. Your task is to determine the minimum number of operations required to transform s into t.

This is equivalent to counting the number of positions where the two strings differ. Formally, if we denote the answer as \( d \), then

[ d = \sum_{i=1}^{n} \mathbf{1}{s_i \neq t_i}, ]

where ( \mathbf{1}{s_i \neq t_i} ) is the indicator function that is 1 if ( s_i \neq t_i ) and 0 otherwise.

Note: The input will be provided via standard input (stdin) and the output should be printed to standard output (stdout).

inputFormat

The input consists of three lines:

1. An integer n representing the length of the strings.
2. A string s — the initial string.
3. A string t — the target string.

It is guaranteed that the length of s and t is exactly n.

outputFormat

Output a single integer: the minimum number of operations required to transform s into t.

## sample

5
abcde
bcdea

5

</p>