오일러 1060,1061

#1060 KOIIOI : 오일러OJ (euleroj.io)

x=input()

a=0

b=0

for i in range(0,len(x)):

    if i+2==len(x):

        break

    if x[i]=='K' and x[i+1]=='O' and x[i+2]=='I':

        a+=1

    if x[i]=='I' and x[i+1]=='O' and x[i+2]=='I':

        b+=1

print(a)

print(b)

#1061 슈퍼마리오 : 오일러OJ (euleroj.io)

#버섯이 10개로 오름차순 나열

#최대점수는 100점이며

#각각 버섯을 어케 먹어야 최대한 많이 득점--->탐욕,동적?

mushroom=[] #버섯 점수 저장시킬 리스트

backPack=[]

onelist=[100]

bp=0

bpp=0

##버섯의 점수를 입력받는다##

for i in range(0,10):

    x=int(input())

    mushroom.append(x)

#print(mushroom)

for i in range(0,10):

    backPack.append(0)

for i in range(0,10):

    if i==0:

        backPack[i]=mushroom[i]

    else:

        backPack[i]=backPack[i-1]+mushroom[i]

    

    if backPack[i]>=100 or i==9:

        bp=backPack[i]

        bpp=backPack[i-1]

        break

bpT=bp-onelist[0]

bppT=bpp-onelist[0]

bppT*=int(-1)

if bpT<=bppT:

    print(bp)

else:

    print(bpp)