Problem:


Score : 100 points

Problem Statement

CODE FESTIVAL 2016 is going to be held. For the occasion, Mr. Takahashi decided to make a signboard.

He intended to write CODEFESTIVAL2016 on it, but he mistakenly wrote a different string S. Fortunately, the string he wrote was the correct length.

So Mr. Takahashi decided to perform an operation that replaces a certain character with another in the minimum number of iterations, changing the string to CODEFESTIVAL2016.

Find the minimum number of iterations for the rewrite operation.

Constraints

S is 16 characters long.

S consists of uppercase and lowercase alphabet letters and numerals.

Input

Inputs are provided from Standard Input in the following form.

S

Output

Output an integer representing the minimum number of iterations needed for the rewrite operation.

Sample Input 1

C0DEFESTIVAL2O16

Sample Output 1

2

The second character 0 must be changed to O and the 14th character O changed to 0.

Sample Input 2

FESTIVAL2016CODE

Sample Output 2

16



Sample input:
C0DEFESTIVAL2O16


Sample output:
2

Submission status: Accepted

Solution code:
S = input()
good = "CODEFESTIVAL2016"

ans = 0

for i in range(len(S)):
    if S[i] != good[i]:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
i = input()
truetext = "CODEFESTIVAL2016"
ans = 0
for t in range(len(i)):
  if i[t] != truetext[t]:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = input()

correct_s = 'CODEFESTIVAL2016'

ans = 0
for s1, s2 in zip(S, correct_s):
    if s1 != s2:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
truth = 'CODEFESTIVAL2016'
S = input()

ans = 0
for i in range(16):
  ans += (S[i] != truth[i])

print(ans)

Submission status: Accepted

Solution code:
print(sum(c1 != c2 for c1, c2 in zip('CODEFESTIVAL2016', input())))

Submission status: Accepted

Solution code:
n = 'CODEFESTIVAL2016'
s = input()
a = 0
for i in range(0, len(n)):
    if n[i] != s[i]:
        a+=1
print(a)

Submission status: Accepted

Solution code:
s = input()
t = 'CODEFESTIVAL2016'
ans = 0
for i in range(len(s)):
    if s[i] != t[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
print(len([x for x in map(set, zip(input(), 'CODEFESTIVAL2016')) if len(x) == 2]))

Submission status: Accepted

Solution code:
print(sum(c1 != c2 for c1, c2 in zip('CODEFESTIVAL2016', input())))

Submission status: Accepted

Solution code:
s = input()
a = "CODEFESTIVAL2016"
cnt = 0
for i in range(len(s)):
    if s[i] != a[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
S = input()
cnt=0
for i,c in enumerate("CODEFESTIVAL2016"):
    cnt+=S[i]!=c
print(cnt)

Submission status: Accepted

Solution code:
right_word = 'CODEFESTIVAL2016'
s = input()
cnt = 0
for i in range(len(s)):
    if s[i] != right_word[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s = str(input())

x = "CODEFESTIVAL2016"
count = 0

for i in range(len(s)):
    if s[i] != x[i]:
        count += 1

print(count)

Submission status: Accepted

Solution code:
S = input()
T = 'CODEFESTIVAL2016'
cnt=0
for s, t in zip(S, T):
    if s!=t:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
S = input()

A = 'CODEFESTIVAL2016'
ans = 0
for i in range(16):
    if S[i] != A[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
s = input()
S = 'CODEFESTIVAL2016'
ans = 0
for c, C in zip(s, S):
    if c != C:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
S=list(str(input()))
G='CODEFESTIVAL2016'
t=0
for i in range(16):
  if S[i]!=G[i]:
    t+=1
print(t)

Submission status: Accepted

Solution code:
s = list(input())
temp = list("CODEFESTIVAL2016")

ans = 0
for i, j in zip(s, temp):
    if i != j:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
s=input()
ss='CODEFESTIVAL2016'
n=0
for i in range(len(s)):
    if s[i]!=ss[i]:
        n+=1
print(n)

Submission status: Accepted

Solution code:
S = input()
ans = 0
for i in range(len(S)):
  if S[i] != "CODEFESTIVAL2016"[i]: ans += 1
print(ans)

Submission status: Accepted

Solution code:
s = input()
ans = 'CODEFESTIVAL2016'

count = 0
for i in range(len(s)):
  if s[i] != ans[i]:
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2016 予選 B: A – Signboard
expects = 'CODEFESTIVAL2016'
s = input()
print(sum([a != b for a, b in zip(expects, s)]))

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2016 予選 B: A – Signboard
expects = 'CODEFESTIVAL2016'
s = input()

count = 0

for a, b in zip(expects, s):
    if a != b:
        count += 1

print(count)

Submission status: Accepted

Solution code:
S = input()
A = "CODEFESTIVAL2016"

ans = 0
for i in range(len(S)) :
    if S[i] != A[i] :
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
c='CODEFESTIVAL2016'
s=input()
cnt=0
for i in range(16):
    if s[i] != c[i]:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
s = input()
ans = 'CODEFESTIVAL2016'
cnt = 0
for i in range(len(s)):
  if s[i] != ans[i]:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
t = 'CODEFESTIVAL2016'
s = input()
cnt = 0
for i in range(len(t)):
    if s[i]!=t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [str(i) for i in input().split()]
    count = 0
    s = "CODEFESTIVAL2016"
    for i in range(16):
        if a[0][i] != s[i]:
            count +=1
    print(count)

Submission status: Accepted

Solution code:
s="CODEFESTIVAL2016"
l=input()
cnt=0
for a in range(len(s)):
  if s[a]!=l[a]:
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
c = 'CODEFESTIVAL2016'
s = input()
ans = 0
for i in range(len(c)):
    if c[i] != s[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10

#solve
def solve():
    s = S()
    ans = "CODEFESTIVAL2016"
    x = 0
    for i in range(len(s)):
        x += ans[i] != s[i]
    print(x)
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
s=input()
t="CODEFESTIVAL2016"
print(sum(1 for i in range(len(s)) if s[i]!=t[i]))

Submission status: Accepted

Solution code:
S = input()

list_S = list(S)

list_T = list("CODEFESTIVAL2016")

ans = 0
for i in range(len(list_S)):
  if list_S[i] != list_T[i]:
    ans =ans +1

print(ans)

Submission status: Accepted

Solution code:
s = input()
t = "CODEFESTIVAL2016"

ans = 0
for i in range(16):
    if s[i] != t[i]:
       ans += 1
       
print(ans)

Submission status: Accepted

Solution code:
s = input()
tmp = 'CODEFESTIVAL2016'
res = 0
for i in range(16):
  if s[i] != tmp[i]:
    res += 1
print(res)

Submission status: Accepted

Solution code:
S = input()
target = "CODEFESTIVAL2016"

ans = 0
for s, t in zip(S, target):
    if s != t:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
A = list('CODEFESTIVAL2016')
B = list(input())


t = 0
for i, j in zip(A, B):
    if i != j:
        t += 1
print(t)

Submission status: Accepted

Solution code:
S = input()
s = "CODEFESTIVAL2016"
ans = 0
for i in range(len(s)):
    if (S[i] != s[i]):
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
s = list(input())
S = list("CODEFESTIVAL2016")

ans = 0
for i in range(len(s)):
  if s[i] != S[i]:
    ans += 1
    
print(ans)

Submission status: Accepted

Solution code:
S = input()
t = "CODEFESTIVAL2016"
a = 0
for i in range(16):
    if (t[i] != S[i]):
        a += 1

print(a)

Submission status: Accepted

Solution code:
s = input()
tmp = "CODEFESTIVAL2016"
ans = 0

for i in range(16):
    if s[i] != tmp[i]:
        ans = ans + 1

print(ans)

Submission status: Accepted

Solution code:
s = input()

cnt = 0
for i in range(16):
    if s[i] != "CODEFESTIVAL2016"[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s = input()

base = "CODEFESTIVAL2016"
ans = 0
for e1, e2 in zip(s, base):
    if e1 != e2:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
# Problem A - Signboard

# input process
S = input()

# initialization
teacher_data = "CODEFESTIVAL2016"
swap_count = 0

# count process
for i in range(len(S)):
    if not S[i]==teacher_data[i]:
        swap_count += 1

# output process
print(swap_count)

Submission status: Accepted

Solution code:
s=list(input())
t=list("CODEFESTIVAL2016")
c=0
for x in range(16):
    if t[x]!=s[x]:c+=1
print(c)

Submission status: Accepted

Solution code:
S = input()
CF = 'CODEFESTIVAL2016'

c = 0
for i in range(16):
    if S[i] != CF[i]:
        c += 1

print(c)

Submission status: Accepted

Solution code:
s = input()
cs = 'CODEFESTIVAL2016'
r = 0
for i in range(len(s)):
    if s[i] != cs[i]:
        r += 1
print(r)

Submission status: Accepted

Solution code:
x=input()
x=list(x)
y='CODEFESTIVAL2016'
y=list(y)
z=len(x)
ans=0
for i in range(z):
	if x[i]!=y[i]:
		ans=ans+1
print(ans)

Submission status: Accepted

Solution code:
def main():
    s = input().rstrip()
    t = "CODEFESTIVAL2016"
    ans = 0
    for i in range(16):
        if s[i] != t[i]:
            ans += 1
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    s = input()
    p = "CODEFESTIVAL2016"
    ans = 0

    for i in range(16):
        if s[i] != p[i]:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

t = 'CODEFESTIVAL2016'
ans = 0

for i in range(16):
	if s[i] == t[i]:
		continue
	else:
		ans += 1
		
print(ans)

Submission status: Accepted

Solution code:
S = input()
print(len([i for i in range(len(S)) if 'CODEFESTIVAL2016'[i]!=S[i]]))

Submission status: Accepted

Solution code:
S=list(input())
Scor=list("CODEFESTIVAL2016")
#print(S,Scor)
c=0
for i in range(len(S)):
    if not(S[i]==Scor[i]):
        c=c+1
print(c)

Submission status: Accepted

Solution code:
p='CODEFESTIVAL2016'
s=input()
t=0
for i in range(16):
  if s[i]!=p[i]:
    t+=1
print(t)

Submission status: Accepted

Solution code:
S = input()
T = 'CODEFESTIVAL2016'
ans = 0
for i in range(16):
  if S[i] != T[i]:
    ans +=1
print(ans)

Submission status: Accepted

Solution code:
a="CODEFESTIVAL2016"
s=input()
ans=0
for i in range(16):
  if a[i]!=s[i]:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
s = input()
signboard = 'CODEFESTIVAL2016'

ans = 0
for i in range(len(s)):
    if s[i] != signboard[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
s=input()
t="CODEFESTIVAL2016"
ans=0
for i in range(16):
    if s[i]!=t[i]:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
S = input()
T = "CODEFESTIVAL2016"
print(sum(s != t for s, t in zip(S, T)))

Submission status: Accepted

Solution code:
print(sum(s != t for s, t in zip(input(), 'CODEFESTIVAL2016')))

Submission status: Accepted

Solution code:
s = input()
ans = "CODEFESTIVAL2016"

cnt = 0
for i in range(len(s)):
	cnt += s[i] != ans[i]

print(cnt)

Submission status: Accepted

Solution code:
import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)

MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18

'''
1行のint
N, K = map(int, input().split())

1行のstring
S, T = input().split()

1行の整数配列
P = list(map(int,input().split()))

改行あり整数
x = []
y = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)

N行M列の初期化
dp = [[INF] * M for i in range(N)]

'''

S = input()
T = "CODEFESTIVAL2016"

ans = 0
for i in range(len(S)):
    if S[i] != T[i]:
        ans += 1


print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

s = input()
d = [l1 == l2 for l1, l2 in zip(s, "CODEFESTIVAL2016")]
print(d.count(False))

Submission status: Accepted

Solution code:
S = input()
cor = "CODEFESTIVAL2016"
ans = 0
for i in range(len(S)) :
    if S[i] != cor[i] :
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
S = stdin.readline().rstrip()
sign = 'CODEFESTIVAL2016'
ans = 0
for a, b in zip(S, sign):
    if a != b:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
c = "CODEFESTIVAL2016"
cnt = 0
for i in range(len(s)):
    if s[i] != c[i]: cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
s = input()
c = 'CODEFESTIVAL2016'
ans = 0

for i in range(len(s)):
  if s[i] != c[i]:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
S=input()
print(sum([S[i]!="CODEFESTIVAL2016"[i]for i in range(len(S))]))

Submission status: Accepted

Solution code:
s = input()
t = "CODEFESTIVAL2016"
ans = 0
for i in range(len(s)):
  if s[i] != t[i]:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
s=input()
ans=0
t="CODEFESTIVAL2016"
for i in range(16):
  if s[i]!=t[i]:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
s = "CODEFESTIVAL2016"
i = input()

c = 0

for i, j in zip(s, i):
	if i != j:
		c += 1

print(c)

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    T = "CODEFESTIVAL2016"
    ans = 0
    for s,t in zip(S,T):
        ans += s!=t
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = 'CODEFESTIVAL2016'
ans = 0
for a, b in zip(s, input()):
  if a != b:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = input()
right = "CODEFESTIVAL2016"
cnt = 0
for i in range(len(S)):
	if S[i] != right[i]:
		cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
a="CODEFESTIVAL2016"
b=input()
a1=0
for i in range(0,len(b)):
    if a[i] != b[i]:
        a1=a1+1
print(a1)

Submission status: Accepted

Solution code:
s = list(input())

a = list("CODEFESTIVAL2016")

ans = 0
for i,j in zip(s,a):
    if i != j:
        ans += 1
    

print(ans)

Submission status: Accepted

Solution code:
s,t,a=input(),'CODEFESTIVAL2016',0
for i in range(16):
    if s[i]!=t[i]:
        a+=1
print(a)

Submission status: Accepted

Solution code:
s = "CODEFESTIVAL2016"
inp = input()
c = 0
for i in range(len(s)):
    if s[i] != inp[i]:
        c += 1
print(c)

Submission status: Accepted

Solution code:
s=input()
t='CODEFESTIVAL2016'
count=0
for i in range(16):
    if s[i]==t[i]:
        continue
    else:
        count+=1
print(count)

Submission status: Accepted

Solution code:
ac="CODEFESTIVAL2016"
s=input()
c=0
for i in range(len(s)):
  if ac[i] != s[i]:
    c=c+1
    
print(c)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    name = 'CODEFESTIVAL2016'
    s = input()
    ans = 0
    for i in range(16):
        if s[i] != name[i]:
            ans += 1
    print(ans)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
def examA():
    S = SI(); N = len(S)
    T = "CODEFESTIVAL2016"
    ans = 0
    for i in range(N):
        if S[i]!=T[i]:
            ans +=1
    print(ans)
    return

def examB():
    return

def examC():
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,ALPHABET, _ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 1e-9
alphabet = [chr(ord('a') + i) for i in range(26)]
ALPHABET = [chr(ord('A') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

Submission status: Accepted

Solution code:
from sys import stdin
s = stdin.readline().rstrip()
k = "CODEFESTIVAL2016"
point = 0
for i in range(len(s)):
    if k[i] != s[i]:
        point += 1
print(point)

Submission status: Accepted

Solution code:
s = input()
t = "CODEFESTIVAL2016"
ans = 0
for i in range(len(s)):
    if s[i] != t[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
s=input()
cor='CODEFESTIVAL2016'
cnt = 0

for i in range(len(s)):
    if(s[i] != cor[i]):
        c_s = cor[:i+1]+s[i+1:]
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
def main():
    S = input()
    ans = "CODEFESTIVAL2016"
    cnt = 0
    for s,a in zip(S,ans):
        if s==a:
            pass
        else:
            cnt += 1
    print(cnt)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
a = "CODEFESTIVAL2016"
ans = 0
for i in range(16):
	if s[i] != a[i]:
		ans += 1

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
S = str(input())

cnt = 0
A = "CODEFESTIVAL2016"

for i in range(len(S)) :
  if S[i] != A[i] :
    cnt += 1
print (cnt)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = input()

ans = 0
for s, t in zip(S, 'CODEFESTIVAL2016'):
    if s != t:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
a = 'CODEFESTIVAL2016'
b = input()
lista = list(a)
listb = list(b)
count = 0
for i in range(len(lista)):
  if lista[i]!=listb[i]:
    count+=1
print(count)

Submission status: Accepted

Solution code:
s = list(input())
l = list("CODEFESTIVAL2016")
ans = 0
for i in range(16):
    if s[i] != l[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
ans = 0
for s1, s2 in zip('CODEFESTIVAL2016', input()):
  if s1 != s2:ans += 1
print(ans)

Submission status: Accepted

Solution code:
O = "CODEFESTIVAL2016"
S = input()
ans = 0
for i in range(len(O)):
  if O[i] != S[i]:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
S="CODEFESTIVAL2016"
N=input()
ans=0
for i in range(16):
    if S[i]!=N[i]:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
s = input()
ans = 0
for i, j in zip(s, "CODEFESTIVAL2016"):
    if i != j:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = input()
T = "CODEFESTIVAL2016"
ans = 0
for i in range(16):
    if S[i] != T[i]: ans += 1
print(ans)

Submission status: Accepted

Solution code:
S1=list(input())
S2=list('CODEFESTIVAL2016')
cnt=0
for i in range(len(S1)):
    if S1[i]!=S2[i]:
        cnt=cnt+1

print(cnt)

Submission status: Accepted

Solution code:
S = "CODEFESTIVAL2016"
s = input()
result = 0
for i in range(16):
  if S[i] != s[i]:
    result += 1
print(result)

Submission status: Accepted

Solution code:
S = input().strip()
X = "CODEFESTIVAL2016"
cnt = 0
for i in range(len(S)):
    if S[i]!=X[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
ans = 0
S = input()

a = "CODEFESTIVAL2016"

for i in range(16):
  if a[i] != S[i]:
    ans+=1
    
print (ans)

Submission status: Accepted

Solution code:
S = input()
T = 'CODEFESTIVAL2016'

print(sum(S[i] != T[i]for i in range(16)))

Submission status: Accepted

Solution code:
a = list(input())
s = list('CODEFESTIVAL2016')
b = 0
x = -1
dx = -1
while 1:
    x += 1
    dx += 1
    if x == len(a):
        break
    elif a[x] != s[dx]:
        b += 1
print(b)

Submission status: Accepted

Solution code:
s = input()

t = 'CODEFESTIVAL2016'

ans = 0

for i in range(16):
	if s[i]!=t[i]:
		ans = ans + 1
		
print(ans)

Submission status: Accepted

Solution code:
s=input()
code='CODEFESTIVAL2016'

ans=0
for i,j in zip(s,code):
    if i!=j:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
s = input()
c = "CODEFESTIVAL2016"

ans = 0
for i in range(16):
    if s[i] != c[i]:
      ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = list(input())
SS = list("CODEFESTIVAL2016")
print(sum([1 for i in range(len(S)) if S[i] != SS[i]]))

Submission status: Accepted

Solution code:
S = input()
correct = "CODEFESTIVAL2016"
rewrite = 0

for i in range(len(S)):
    if S[i] != correct[i]:
        rewrite += 1

print(rewrite)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = list(input())[: -1]
t = list("CODEFESTIVAL2016")
res = 0
for i in range(16):
  if S[i] != t[i]:
    res += 1
print(res)

Submission status: Accepted

Solution code:
S = input()
T = "CODEFESTIVAL2016"
ans = 0
for i in range(16):
  if S[i] != T[i]:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = str(input())
A = 'CODEFESTIVAL2016'
cnt = 0
for i in range(len(A)):
    if A[i] != S[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
S = input()
answer = 0
s = 'CODEFESTIVAL2016'

for i in range(len(S)):
    if S[i] != s[i]:
        answer += 1

print(answer)

Submission status: Accepted

Solution code:
s = input()
a = "CODEFESTIVAL2016"
ans = 0
for x,y in zip(s,a):
  if x != y:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
s=input()
ans="CODEFESTIVAL2016"
anss=0
for i in range(16):
	if s[i]!=ans[i]:
		anss+=1
print(anss)

Submission status: Accepted

Solution code:
#coding:utf-8
s = input()
b = 'CODEFESTIVAL2016'
count = 0

for i in range(len(b)):
  if s[i] != b[i]:
    count += 1

print(count)

Submission status: Accepted

Solution code:
ans = "CODEFESTIVAL2016"
inp = input()

num = 0
for a,c in zip(ans, inp):
  if a != c:
    num += 1

print(num)

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    s = str(readline().rstrip().decode('utf-8'))
    cs = "CODEFESTIVAL2016"
    cnt = 0
    for i in range(len(cs)):
        if s[i] != cs[i]:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
S = input()
tar = "CODEFESTIVAL2016"
ans = 0
for s,t in zip(S,tar):
  if s != t:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
S0='CODEFESTIVAL2016'
S=input()
ans=sum([S[i]!=S0[i] for i in range(len(S0))])
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(S: str):
    
    cf = 'CODEFESTIVAL2016'
    print([S[i]!=cf[i] for i in range(len(S))].count(True))

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = str('CODEFESTIVAL2016')
B = str(input())
ans = 0
for i in range(16):
    if A[i] != B[i]:
        ans += 1
        
print(ans)

Submission status: Accepted

Solution code:
s=input()
a='CODEFESTIVAL2016'
cnt=0
for i in range(len(s)):
    if s[i]!=a[i]:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
s = input()
ori_str = 'CODEFESTIVAL2016'
cnt = 0
for i in range(len(s)):
    if s[i] != ori_str[i]:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
print(sum((t!=s for t,s in zip('CODEFESTIVAL2016',input()))))

Submission status: Accepted

Solution code:
T = 'CODEFESTIVAL2016'
S = input()
print(sum((t != s for t, s in zip(T, S))))

Submission status: Accepted

Solution code:
s = input()
a = "CODEFESTIVAL2016"
ans = [i != j for i, j in zip(s, a)]
print(sum(ans))

Submission status: Accepted

Solution code:
S=input()
ans = 0
for i in range(len(S)):
  if S[i] != "CODEFESTIVAL2016"[i]:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
s = input()
t = "CODEFESTIVAL2016"
c = 0
for i in range(16):
  if s[i] != t[i]:
    c += 1
print(c)

Submission status: Accepted

Solution code:
a="CODEFESTIVAL2016"
s=input()
ans=0
for i in range(len(a)):
  if a[i]!=s[i]:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
s = list(input())

check = list("CODEFESTIVAL2016")
cnt = 0

for x,y in zip(s,check):
    if x != y:
        cnt += 1
        
print(cnt)

Submission status: Accepted

Solution code:
print(sum(c1!=c2 for c1, c2 in zip(input(), "CODEFESTIVAL2016")))

Submission status: Accepted

Solution code:
s = input()
cnt = 0
c = "CODEFESTIVAL2016"
for i, j in zip(s, c):
    if i != j:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2016 予選 B: A – Signboard
s = input()
s_correct = 'CODEFESTIVAL2016'

iterations = 0

for i in range(len(s)):
    if s[i] != s_correct[i]:
        iterations += 1

print(iterations)

Submission status: Accepted

Solution code:
#Signboard
S = "CODEFESTIVAL2016"
s1 = input()
count = 0
for i in range(16):
    if S[i] != s1[i]:
        count =count + 1
print(count)

Submission status: Accepted

Solution code:
s = input()
ref = "CODEFESTIVAL2016"
ans = 0
for i in range(16):
  if s[i] != ref[i]:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
s=list(input())
a=list('CODEFESTIVAL2016')
ans=0
for i in range(len(s)):
  if s[i]!=a[i]:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
S=input()
T="CODEFESTIVAL2016"
ans=0
for i in range(len(S)):
  if(S[i]!=T[i]):
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
s=input()
ans="CODEFESTIVAL2016"
tmp=0
for i in range(len(s)):
    if ans[i]!=s[i]:
        tmp+=1

print(tmp)

Submission status: Accepted

Solution code:
S = input()
C = 'CODEFESTIVAL2016'

ans = 0
for s, c in zip(S, C):
    if s != c:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
s = str(input())
x = 'CODEFESTIVAL2016'
ans = 0
for i,j in zip(s,x):
    if i != j:
        i = j
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
S = input()
K = "CODEFESTIVAL2016"
sum = 0
for i in range(len(S)):
  if S[i] != K[i]:
    sum += 1
print(sum)

Submission status: Accepted

Solution code:
s=str(input())

def solve(s):
  res=0
  t="CODEFESTIVAL2016"
  for i in range(len(s)):
    if s[i]!=t[i]:
      res+=1
  return res
  
print(solve(s))

Submission status: Accepted

Solution code:
print(len(list(filter(lambda x: x == 0, map(lambda x, y: True if x == y else False, list("CODEFESTIVAL2016"), list(input()))))))

Submission status: Accepted

Solution code:
A = list("CODEFESTIVAL2016")
S = list(input())
count = 0
for i, j in zip(A, S):
    if i != j:
        count += 1
print(count)

Submission status: Accepted

Solution code:
print(sum(i!=j for i,j in zip(input(),"CODEFESTIVAL2016")))

Submission status: Accepted

Solution code:
s = input()

print(len([a for a, b in zip("CODEFESTIVAL2016", s) if a != b]))

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    ls = list("CODEFESTIVAL2016")
    s = str(input().rstrip('\n'))
    cnt = 0
    for i in range(len(s)):
        if ls[i] != s[i]:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
#list(map(int, input().split()))
s=input()
t='CODEFESTIVAL2016'
ans=0
for i in range(16):
    if t[i]!=s[i]:ans+=1
print(ans)

Submission status: Accepted

Solution code:
S = input()
T = "CODEFESTIVAL2016"
ans = 0
for s, t in zip(S, T):
    if s != t:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
'''A - Signboard
https://atcoder.jp/contests/code-festival-2016-qualb/tasks/codefestival_2016_qualB_a

>>> main('C0DEFESTIVAL2O16')
2
>>> main('FESTIVAL2016CODE')
16
'''


def main(s):
    base = 'CODEFESTIVAL2016'
    count = 0

    for _s, _b in zip(s, base):
        if _s != _b:
            count += 1

    print(count)


if __name__ == "__main__":
    main(input())