Taco Transformation

You are given two strings s and t of equal length. Your task is to determine the minimum number of operations required to transform string s into string t.

In each operation, you can change any character in s to any other lowercase English letter. The required number of operations is equal to the number of positions where the two strings differ. More formally, if the strings have length n, the answer is given by:

\[ \text{operations} = \sum_{i=1}^{n} \mathbb{1}_{\{s_i \neq t_i\}} \]

For example, if s = "ababab" and t = "bababa", every character is different, so the answer is 6.

inputFormat

The input consists of two lines. The first line contains the string s and the second line contains the string t. It is guaranteed that both strings have the same length.

outputFormat

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

abc
abc

0