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 14 th character O changed to 0 .       Sample Input 2 FESTIVAL2016CODE      Sample Output 2 16

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

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

print(cnt)

Solution (Python):
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)

Solution (Python):


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

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

Solution (Python):
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)

Solution (Python):

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

print(cnt)

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

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

print(ans)

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

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

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

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

c = 0

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

print(c)

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
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()

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

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

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

Solution (Python):
s = list(input())

a = list("CODEFESTIVAL2016")

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

print(ans)

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

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

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

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

Solution (Python):
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()

Solution (Python):
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()

Solution (Python):
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)

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

Solution (Python):
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)

Solution (Python):
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()

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

print(ans)

Solution (Python):

 
import math
import itertools
import sys
import copy
 





S = str(input())

cnt = 0
A = "CODEFESTIVAL2016"

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

Solution (Python):


S = input()

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

print(ans)

Solution (Python):
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)

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

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

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

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

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

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

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

print(cnt)

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

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

Solution (Python):
ans = 0
S = input()

a = "CODEFESTIVAL2016"

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

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

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

Solution (Python):
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)

Solution (Python):
s = input()

t = 'CODEFESTIVAL2016'

ans = 0

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

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

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

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

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

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

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

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

print(rewrite)

Solution (Python):
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)

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

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

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

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

print(answer)

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

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

Solution (Python):

s = input()
b = 'CODEFESTIVAL2016'
count = 0

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

print(count)

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

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

print(num)

Solution (Python):
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()

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

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

Solution (Python):

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)  
    solve(S)

if __name__ == '__main__':
    main()

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

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

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

print(cnt)

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

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

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

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

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

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

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

Solution (Python):
s = list(input())

check = list("CODEFESTIVAL2016")
cnt = 0

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

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

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

Solution (Python):

s = input()
s_correct = 'CODEFESTIVAL2016'

iterations = 0

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

print(iterations)

Solution (Python):

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

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

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

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

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

print(tmp)

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

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

print(ans)

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

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

Solution (Python):
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))

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
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()

Solution (Python):

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

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

Solution (Python):
'''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())

Solution (Python):

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

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

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

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

Solution (Python):
s = list(input())
d = 'CODEFESTIVAL2016'
l = list(d)

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

Solution (Python):
from sys import stdin

def readString() :
    return  stdin.readline().rstrip()

def solve() :
    S = "CODEFESTIVAL2016"
    T = stdin.readline().rstrip()
    ans = 0 
    for x in range(len(S)):
        if(S[x] != T[x]) :
            ans += 1

    print(ans)

solve()

Solution (Python):
S=input()
T="CODEFESTIVAL2016"
N=len(T)

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

Solution (Python):
S = list(input())

C = list("CODEFESTIVAL2016")

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

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

Solution (Python):
def main():

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



if __name__ == '__main__':
    print(main())

Solution (Python):
ANS = 'CODEFESTIVAL2016'
S = input()
cnt = 0
for i in range(len(S)):
    if S[i] != ANS[i]:
        cnt += 1

print(cnt)

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

print(sum([i != j for i, j in zip(s, t)]))

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

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque




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



if __name__ == '__main__':
    main()

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

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

Solution (Python):
print(sum(c!=d for c,d in zip("CODEFESTIVAL2016",input())))

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

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


if __name__ == '__main__':
    slove()

Solution (Python):
S = input()
T = "CODEFESTIVAL2016"
ans = 0

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

print(ans)

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

print(ans)

Solution (Python):
S1 = str(input())
S2 = "CODEFESTIVAL2016"

cnt = 0
for i in range(len(S1)):
    if S1[i] != S2[i]:
        cnt += 1
print(cnt)

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

Solution (Python):
def solve(s):
    return len(list(filter(lambda x: x[0] != x[1], zip(s, "CODEFESTIVAL2016"))))

print(solve(input()))

Solution (Python):
S=input()
print(sum(s!="CODEFESTIVAL2016"[i] for i,s in enumerate(S)))

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

Solution (Python):
S=input()
print(sum([1 for _ in range(16) if S[_]!='CODEFESTIVAL2016'[_]]))

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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20; INF = float("INF"); ans = 0; tmp = 0; cnt = 0; ansli = []; tmpli = []; candili = []; stillset = set()
eps = 1.0 / 10 ** 10; mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]; ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]; ddn9 = ddn + [(0, 0)]
"""for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:"""
def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def ws(): return sys.stdin.readline().split()
def i(): return int(sys.stdin.readline())
def s(): return input()
def s_list(): return list(input())
def hi(n): return [i() for _ in range(n)]
def hs(n): return [s() for _ in range(n)]
def mi(n): return [wi() for _ in range(n)]
def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[0]] for _ in range(n)]
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]
def grid(n): return [s_list() for _ in range(n)]


if __name__ == '__main__':
    s = s()
    cf = "CODEFESTIVAL2016"
    for i in range(len(s)):
        if s[i] != cf[i]:
            ans += 1
    print(ans)

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

Solution (Python):
k=0
t=0
s='CODEFESTIVAL2016'
for x in input():
    if x!=s[k]:
        t+=1
    k+=1
print(t)

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

ans_list = [ s[i] != t[i] for i in range(16) ]
print(ans_list.count(True))

Solution (Python):



seikai = 'CODEFESTIVAL2016'
matigai_count = 0

s = input()

for i in range(16):
    
    
    if s[i] == seikai[i]:
        
        pass
    else:
        
        matigai_count += 1

print(matigai_count)

Solution (Python):
print(len([i for i, j in zip(list(input()), list("CODEFESTIVAL2016")) if i!=j]))

Solution (Python):
S=input()
ans='CODEFESTIVAL2016'

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

Solution (Python):
S = input()

C = "CODEFESTIVAL2016"

ans = 0

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

print(ans)

Solution (Python):
s = input()
t = 'CODEFESTIVAL2016'
ans = 0

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

Solution (Python):
S = input()
T = "CODEFESTIVAL2016"

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

Solution (Python):
s = input()

cnt=0
if s[0]!="C":
    cnt+=1
if s[1] != "O":
    cnt += 1
if s[2] != "D":
    cnt += 1
if s[3] != "E":
    cnt += 1
if s[4]!="F":
    cnt+=1
if s[5]!="E":
    cnt+=1
if s[6]!="S":
    cnt+=1
if s[7]!="T":
    cnt+=1
if s[8]!="I":
    cnt+=1
if s[9]!="V":
    cnt+=1
if s[10] != "A":
    cnt += 1
if s[11] != "L":
    cnt += 1
if s[12] != "2":
    cnt += 1
if s[13] != "0":
    cnt += 1
if s[14] != "1":
    cnt += 1
if s[15] != "6":
    cnt += 1

print(cnt)

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

Solution (Python):
S = input()
T = "CODEFESTIVAL2016"

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

Solution (Python):

def main():
    S = input().rstrip()
    C = "CODEFESTIVAL2016"
    ans = sum(i != j for i, j in zip(S, C))
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
string = "CODEFESTIVAL2016"

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

print(count)

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

Solution (Python):
s = input()
c = 'CODEFESTIVAL2016'
g = 0
for ss,cc in zip(s,c):
    if ss != cc:g+=1
print(g)

Solution (Python):
t = 'CODEFESTIVAL2016'
s = input()
cnt = 0
for i in range(16):
    cnt += (s[i] != t[i])
print(cnt)

Solution (Python):
S=input()
A="CODEFESTIVAL2016"
c=0
for i in range(16):
  if S[i]!=A[i]:
    c+=1
print(c)

Solution (Python):
S = input()

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

print(count)

Solution (Python):
N=input()
s='CODEFESTIVAL2016'
ans=0
for i in range(16):
    if not N[i]==s[i]:ans+=1
print(ans)

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

Solution (Python):
cd = "CODEFESTIVAL2016"
s = input()

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

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

Solution (Python):

s = input()
r = 'CODEFESTIVAL2016'

count = 0
for el_s, el_r in zip(s, r):
    if el_s != el_r:
        count += 1
print(count)

Solution (Python):
S = input()

count = 0
for i, s in enumerate(S):
	count += (s != "CODEFESTIVAL2016"[i])
print(count)

Solution (Python):
def main():
    S = input()
    target = "CODEFESTIVAL2016"
    ans = 0
    for i, s in enumerate(S):
        if s != target[i]:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
ans = 0
chk = "CODEFESTIVAL2016"
for i, s in enumerate(S):
    if s != chk[i]:
        ans += 1
print(ans)

Solution (Python):
s = input()
a = 'CODEFESTIVAL2016'

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

Solution (Python):
S1=input()
S2='CODEFESTIVAL2016'

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

print(ans)

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

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

Solution (Python):
A="CODEFESTIVAL2016"
B=input()
C=0
for a,b in zip(A,B):
  if a==b:
    continue
  else:
    C=C+1
print(C)

Solution (Python):
S = input()
T = "CODEFESTIVAL2016"
s = 0
for i,j in zip(S, T):
  if i == j:
    s += 1
print(16-s)

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

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

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

Solution (Python):
S = input()
A = 'CODEFESTIVAL2016'
ans = 0
for i in range(len(S)):
  if S[i] != A[i]:
    ans += 1

print(ans)

Solution (Python):
S = input()
cnt = 0
for idx, val in enumerate(S):
        if val != 'CODEFESTIVAL2016'[idx]:
                cnt += 1

print(cnt)

Solution (Python):
a=input()
ans=0
correct='CODEFESTIVAL2016'
for i in range(16):
  if a[i]!=correct[i]:
    ans+=1
print(ans)

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

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

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

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

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

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

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

Solution (Python):
S = input()

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

print(ans)

Solution (Python):

import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())


S = input()
rightans = "CODEFESTIVAL2016"

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

print(ans)

Solution (Python):
s = input()
TITLE = 'CODEFESTIVAL2016'
count = 0

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

print(count)

Solution (Python):
s=input();print(sum("CODEFESTIVAL2016"[i]!=s[i] for i in range(16)))

Solution (Python):
s = input().rstrip()
count = 0
for i in range(len(s)):
  if s[i] != 'CODEFESTIVAL2016'[i]:
    count += 1
print(count)

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

Solution (Python):
a='CODEFESTIVAL2016'
s=input()
cnt=0
for i,j in zip(a,s):
    if i!=j:
        cnt+=1
print(cnt)

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

Solution (Python):
S = input()

truth = "CODEFESTIVAL2016"

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

print(c)

Solution (Python):
s = list(input())
t = list("CODEFESTIVAL2016")
ans = 0

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

print(ans)

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

Solution (Python):
s=input()
t='CODEFESTIVAL2016'

count=0
for num in range(len(s)):
    if s[num] != t[num]:
        count += 1

print(count)

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