LJESNJAK
시간 제한: 1000ms메모리 제한: 128MB출처: COCI 2008-2009BOJ 2941
문제
Not so long ago, before operating systems were as powerful as they are today, computers (which often had turbo buttons on the exterior) couldn't handle certain letters of the Croatian alphabet. Programmers agreed to use two or three-letter substitutions as in this table:
| Letter | Characters |
|---|---|
| č | c= |
| ć | c- |
| dž | dz= |
| đ | d- |
| lj | lj |
| nj | nj |
| š | s= |
| ž | z= |
For example, the word ljes=njak consists of six letters in the Croatian alphabet: lj, e, š, nj, a, k.
Write a program that calculates the number of letters in the given word.
입력
The first line contains a string of at most 100 characters. Only lowercase letters of the English alphabet and characters '–' and '=' will appear.
The string will represent a word encoded as described above.
출력
Output the number of letters in the input word.
예제
예제 1
입력
ljes=njak
출력
6
예제 2
입력
ddz=z=
출력
3
예제 3
입력
nljj
출력
3
예제 4
입력
c=c=
출력
2
예제 5
입력
dz=ak
출력
3
코드를 제출하려면 로그인하세요.