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()
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(len(S)):
    if S[i] != T[i]:
        ans += 1
print(ans)

Solution (Python):
S = "CODEFESTIVAL2016"
T = input()
ans = 0
for i in range(16):
  if S[i] != T[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):
s = input()
t = 'CODEFESTIVAL2016'
ans = 0
for i in range(16):
  if s[i] != t[i]: 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):
n = input()
a = "CODEFESTIVAL2016"
c = 0
for i in range(len(a)):
    if a[i]!=n[i]:
        c+=1
print(c)

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

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):
def main():
    s = input()
    c = "CODEFESTIVAL2016"
    cnt = 0

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

    print(cnt)


if __name__ == "__main__":
    main()

Solution (Python):

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

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

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

Solution (Python):
s = input()

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

print(cnt)

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

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

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

Solution (Python):
a = input()
b = "CODEFESTIVAL2016"
c = 0
for i in range(len(b)):
    if a[i] == b[i]:
        continue
    else:
        c = c + 1
print(c)

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

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

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

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

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

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

Solution (Python):
S = input()
a = "CODEFESTIVAL2016"
cnt = 0

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

print (cnt)

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

Solution (Python):
import sys, math, re
from functools import lru_cache
from collections import defaultdict
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

def main():
    S = input()
    T = 'CODEFESTIVAL2016'

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

if __name__ == '__main__':
    main()

Solution (Python):
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  S=pin()[:-1]
  ans=0
  T="CODEFESTIVAL2016"
  for i in range(16):
    if S[i]==T[i]:
      continue
    ans+=1
  print(ans)
  return 

main()

Solution (Python):

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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    S = input()
    A = 'CODEFESTIVAL2016'
    ans = 0
    for s, a in zip(S,A):
        if s!=a:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

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

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

print(ans)

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

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

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

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()
target = 'CODEFESTIVAL2016'
res = 0
for i in range(16):
    if s[i] != target[i]:
        res += 1
print(res)

Solution (Python):
s = input()

ans = 0
word = "CODEFESTIVAL2016"

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

print(ans)

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

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()
    T = "CODEFESTIVAL2016"

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

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    s=input()
    xx="CODEFESTIVAL2016"
    z=0
    for i in range(0,len(xx)):
        if(s[i]!=xx[i]):
            z+=1
    print(z)

main()

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

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()
a = "CODEFESTIVAL2016"
ans = 0
for i in range(16):
  if a[i] != s[i]:
    ans += 1
print(ans)

Solution (Python):
def main():
    S = input()
    ref = "CODEFESTIVAL2016"
    ans = 0

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

    print(ans)
    
if __name__ == "__main__":
    main()

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

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

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

print(cnt)

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

Solution (Python):
s1 = input()
s2 = 'CODEFESTIVAL2016'
ans = 0
for i in range(min(len(s1), len(s2))):
    if s1[i] != s2[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()
org="CODEFESTIVAL2016"

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

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

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

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

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

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

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

Solution (Python):
s=str(input())
s=list(s)
ans=0
if s[0]!="C":
  ans=ans+1
if s[1]!="O":
  ans=ans+1
if s[2]!="D":
  ans=ans+1
if s[3]!="E":
  ans=ans+1
if s[4]!="F":
  ans=ans+1
if s[5]!="E":
  ans=ans+1
if s[6]!="S":
  ans=ans+1
if s[7]!="T":
  ans=ans+1
if s[8]!="I":
  ans=ans+1
if s[9]!="V":
  ans=ans+1
if s[10]!="A":
  ans=ans+1
if s[11]!="L":
  ans=ans+1
if s[12]!="2":
  ans=ans+1
if s[13]!="0":
  ans=ans+1
if s[14]!="1":
  ans=ans+1
if s[15]!="6":
  ans=ans+1
print(ans)

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

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):

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

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

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

Solution (Python):
s=input()

bb='CODEFESTIVAL2016'

ans=0
i=0
while i<len(bb):
    
    if s[i]!=bb[i]:
        ans+=1

    i+=1

print(ans)

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

t_s = list('CODEFESTIVAL2016')
n = len(t_s)
cnt = 0

for s1,s2 in zip(s,t_s):
    if s1 != s2:
        cnt += 1
print(cnt)

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

Solution (Python):
s, = *open(0),
print(sum(a!=b for a, b in zip(s, 'CODEFESTIVAL2016')))

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

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

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"

print(sum([c1 != c2 for (c1, c2) in zip(s, t)]))

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

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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
T = "CODEFESTIVAL2016"
print(sum(x!=y for x, y in zip(S, T)))

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

S = input()

S_correct ="CODEFESTIVAL2016"

ans = 0
for i in range(len(S)):
	if S[i] != S_correct[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):
seikai = "CODEFESTIVAL2016"
ans = 0
S = input()
for i in range(16):
  if S[i] != seikai[i]:
    ans += 1
print(ans)

Solution (Python):
s = list(input())
l = ['C','O','D','E','F','E','S','T','I','V','A','L','2','0','1','6']
c = 0

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

print(c)

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

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

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

if __name__ == '__main__':
    main()

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

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

print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input()

    res = 0
    for i, j in zip(s, "CODEFESTIVAL2016"):
        if i != j:
            res += 1
    print(res)


if __name__ == '__main__':
    resolve()

Solution (Python):
s = input()
count = 0
for si,ti in zip(s,"CODEFESTIVAL2016"):
  if si!=ti:
    count+=1
print(count)

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

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

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

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

def solve():
    S = (input().rstrip())
    ref = "CODEFESTIVAL2016"

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


if __name__ == '__main__':
    solve()

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

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

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

Solution (Python):
correct = 'CODEFESTIVAL2016'
s = input()
ans = 0
for i in range(16):
  if correct[i] != s[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):

correct = 'CODEFESTIVAL2016'
s = input()
ans = 0

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

print(ans)

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

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

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

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

Solution (Python):
s = input()
r = "CODEFESTIVAL2016"
ans = 0
for i in range(len(s)):
  if s[i] != r[i]: 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):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    t='CODEFESTIVAL2016'
    cnt=0
    for ss,tt in zip(s,t):
        if ss!=tt:
            cnt+=1
    print(cnt)
resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    l='CODEFESTIVAL2016'
    s=str(input())
    ls=len(s)
    cnt=0
    for i in range(ls):
        if s[i]!=l[i]: cnt+=1
    print(cnt)
    
resolve()

Solution (Python):

import sys
def input(): return sys.stdin.readline().strip()

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

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

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

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

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

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

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

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

Solution (Python):
r = ['C','O','D','E','F','E','S','T','I','V','A','L','2','0','1','6']
s = list(input())
ans = 0

for i in range(len(s)):
    if s[i] != r[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):
adequate = "CODEFESTIVAL2016"
wrong = input()
cnt = 0

for i in range(len(wrong)):
    if adequate[i] != wrong[i]:
        cnt += 1

print(cnt)

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

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

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):
a =list('CODEFESTIVAL2016')
b=list(input())
ans=int()
for i in range(16):
    if a[i]!=b[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):
c = 'CODEFESTIVAL2016'
s = input()

co = 0

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    s = input().rstrip()
    res = 0
    a = 'CODEFESTIVAL2016'
    for i in range(16):
        if s[i] != a[i]:
            res += 1
    print(res)

if __name__ == '__main__':
    main()

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

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

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

ans = 0

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

print(ans)

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

Solution (Python):
S = input()

correct_s = 'CODEFESTIVAL2016'

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

print(ans)

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

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

print(ans)

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

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

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):
print(len([x for x in map(set, zip(input(), 'CODEFESTIVAL2016')) if len(x) == 2]))

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

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()
cnt=0
for i,c in enumerate("CODEFESTIVAL2016"):
    cnt+=S[i]!=c
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):
right_word = 'CODEFESTIVAL2016'
s = input()
cnt = 0
for i in range(len(s)):
    if s[i] != right_word[i]:
        cnt += 1
print(cnt)

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

x = "CODEFESTIVAL2016"
count = 0

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

print(count)

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

Solution (Python):
S = input()

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

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

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

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

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

print(ans)

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

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()
ans = 'CODEFESTIVAL2016'

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

Solution (Python):

expects = 'CODEFESTIVAL2016'
s = input()
print(sum([a != b for a, b in zip(expects, s)]))

Solution (Python):

expects = 'CODEFESTIVAL2016'
s = input()

count = 0

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

print(count)

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):
c='CODEFESTIVAL2016'
s=input()
cnt=0
for i in range(16):
    if s[i] != c[i]:
        cnt+=1
print(cnt)

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):
t = 'CODEFESTIVAL2016'
s = input()
cnt = 0
for i in range(len(t)):
    if s[i]!=t[i]:
        cnt += 1
print(cnt)

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

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

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

Solution (Python):

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


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



if __name__ == '__main__':
    solve()

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

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

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()
tmp = 'CODEFESTIVAL2016'
res = 0
for i in range(16):
  if s[i] != tmp[i]:
    res += 1
print(res)

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

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

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


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

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

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

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

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

print(a)

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

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

print(ans)

Solution (Python):
s = input()

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

Solution (Python):
s = input()

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

print(ans)

Solution (Python):



S = input()


teacher_data = "CODEFESTIVAL2016"
swap_count = 0


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


print(swap_count)

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

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

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

print(c)

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

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

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

Solution (Python):









import sys



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

Solution (Python):
s = input()

t = 'CODEFESTIVAL2016'
ans = 0

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

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

Solution (Python):
S=list(input())
Scor=list("CODEFESTIVAL2016")

c=0
for i in range(len(S)):
    if not(S[i]==Scor[i]):
        c=c+1
print(c)

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

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

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

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

ans = 0
for i in range(len(s)):
    if s[i] != signboard[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"
print(sum(s != t for s, t in zip(S, T)))

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