시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 512 MB235545.455%

## 문제

A multi-digit column addition is a formula on adding two integers written like this:

   123
+ 456
-------
579


A multi-digit column addition is written on the blackboard, but the sum is not necessarily correct. We can erase any number of the columns so that the addition becomes correct. For example, in the following addition, we can obtain a correct addition by erasing the second and the forth columns.

   12127           117
+ 45618    ⇒    + 468
---------       -------
51825           585


Your task is to find the minimum number of columns needed to be erased such that the remaining formula becomes a correct addition.

## 입력

There are multiple test cases in the input. Each test case starts with a line containing the single integer n, the number of digit columns in the addition (1 ≤ n ≤ 1000). Each of the next 3 lines contain a string of n digits. The number on the third line is presenting the (not necessarily correct) sum of the numbers in the first and the second line. The input terminates with a line containing “0” which should not be processed.

## 출력

For each test case, print a single line containing the minimum number of columns needed to be erased.

## 예제 입력 1

3
123
456
579
5
12127
45618
51825
2
24
32
32
5
12299
12299
25598
0


## 예제 출력 1

0
2
2
1


## 출처

• 문제의 오타를 찾은 사람: holenet