Satellite

Two stations recorded a transmission from a satellite that passed sequentially over them. The first station recorded only the beginning of the transmission, while the second recorded its end. The received recordings are stored as two strings containing characters from '$a$' to '$z$'.

It is known that the recorded fragments partially overlap, meaning that the end of the first fragment matches the beginning of the second, but the length of this overlap is unknown.

Find the maximum possible length of the overlap between the end of the first fragment and the beginning of the second.

Input

The first line contains the data received by the first station, and the second line contains the data received by the second station. The length of each string does not exceed $10^5$ characters. The strings consist only of lowercase Latin letters.

Output

Output the maximum possible length of the overlap.

Examples