题解 | #公共子串计算#

def cal(a,b): #len(a)<len(b)
    length = 0
    for i in range(1,len(a)+1): #遍历不同长度
        for j in range(len(a)-i+1): #若有子串，更新长度
            if (a[j:(i+j)] in b) and (length<i):
                length = i
    return length

while True:
    try:
        a,b = input(),input()
        if len(a) <= len(b):
            print(cal(a,b))
        else:
            print(cal(b,a))
    except:
        break