NowCode|HJ Series_6

#HJ84 统计大写字母个数
while True:
    try:
        a = input()
        zongshu = 0
        for i in a:
            if i.isupper():
                zongshu += 1
        print(zongshu)
            
    except:
        break
#HJ85 最长回文子串
while True:
    try:
        def ishuiwen(a):
            if a[::-1] == a:
                return 1
            else:
                return 0
        a = input()
        n = len(a)
        zuida = 0
        for i in range(n - 1,-1,-1):
            for j in range(i + 1):
                if ishuiwen(a[j:j + n - i]) == 1:
                    zuida = n - i
                    break
        print(zuida)
    except:
        break    
'''
备注：自定义了一个判断是否是回文串的函数
'''