题解 | #公共子串计算#

import sys

a = input()
b = input()

max_length = 0

dp = [[0 for _ in range(len(b)+1)] for _ in range(len(a)+1)]
for i in range(1,len(a)+1):
    for j in range(1,len(b)+1):
        if a[i-1] == b[j-1]:
            dp[i][j] = dp[i - 1][j - 1] + 1
            
        else:
            dp[i][j] = 0

print(max(max(row) for row in dp))