Minimum Minutes to Transform

You are given two strings S and T of equal length N. In one minute, you can change one character of string S to any other character. Your task is to find the minimum number of minutes required to transform S into T. Formally, let \(d\) be the number of positions where S and T differ. Then the answer is \(d\).

Example: For \(N = 5\), S = "abcde" and T = "edcba", the answer is 4 because the characters differ at positions 0, 1, 3 and 4.

inputFormat

The input is provided via standard input (stdin) with the following format:

N
S
T

Where:

• N is an integer representing the length of the strings.
• S is the source string.
• T is the target string.

outputFormat

Output via standard output (stdout) a single integer, which is the minimum number of minutes required to transform S into T. This value corresponds to the number of positions at which the two strings differ.

5
abcde
edcba

4