The following languages are only available languages for the problems from the contest

Surprise Language Round #7:

- FALSE

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

G. Hamming Distance

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputHamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. You are given two strings; calculate the distance between them.

Input

The input consists of two lines. Each line contains a string of characters 'A'-'Z' between 1 and 100 characters, inclusive. The strings have equal length.

Output

Output Hamming distance between the strings.

Examples

Input

CODECHEF

TOPCODER

Output

6

Input

HAMMING

DISTANC

Output

6

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/22/2020 03:25:16 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|