S=input().rstrip()
k=0
c=0
n=len(S)
while True:
if k<=n-2 and S[k]=='c' and S[k+1]=='=':
k+=1
elif k<=n-2 and S[k]=='c' and S[k+1]=='-':
k+=1
elif k<=n-2 and S[k]=='d' and S[k+1]=='-':
k+=1
elif k<=n-2 and S[k]=='l' and S[k+1]=='j':
k+=1
elif k<=n-2 and S[k]=='n' and S[k+1]=='j':
k+=1
elif k<=n-2 and S[k]=='s' and S[k+1]=='=':
k+=1
elif k<=n-2 and S[k]=='z' and S[k+1]=='=':
k+=1
elif k<=n-3 and S[k]=='d' and S[k+1]=='z' and S[k+2]=="=":
k+=2
k+=1
c+=1
if n-k<=0:
break
print(c)
'백준(BOJ) 풀이' 카테고리의 다른 글
[백준 10250] 10250 ACM 호텔 (0) | 2019.11.14 |
---|---|
[백준 1316] 그룹 단어 체커 (0) | 2019.11.14 |
[백준 5622] 다이얼 (0) | 2019.11.14 |
[백준 2908] 상수 (0) | 2019.11.14 |
[백준 15596] 정수 N개의 합 (0) | 2019.11.14 |