Prefixes and suffixes P33597

Statement

Given two strings $s$ and $t$ , print the maximum $k$ such that the prefix of length $k$ of $s$ is equal to the suffix of length $k$ of $t$ .

Input

Input consists of several cases, each one with $s$ and $t$ . Every string is made up of between 1 and $10^6$ lowercase letters.

For every case, print $k$ .

Public test cases

Input

a b
z z
barbacoa acabar
cabar abacar
cabar acabat
cabar acabar
abacad ababa
acad academiacad

Output

Information