qyliang/CodeNanoFix huggingface dataset:
# Buggy code:
list = list(map(int, input().split())) 
hajime=list[0]
kaisuu=list[1]
hohaba=list[2]
if hajime>=0:
  ayumi=hajime//hohaba
  nokori=kaisuu-ayumi
  kouho_1=hajime-hohaba*kaisuu
  kouho_2=hajime-hohaba*ayumi
  kouho_3=-hajime+hohaba*(ayumi+1)
  if kaisuu=<ayumi:
    print(kouho_1)
  else:
    if nokori%2==0:
      print(kouho_2)
    else:
      print(kouho_3)
      
if hajime<0:  
  ayumi=-hajime//hohaba
  nokori=kaisuu-ayumi
  kouho_1=hajime+hohaba*kaisuu
  kouho_2=hajime+hohaba*ayumi
  kouho_3=-hajime-hohaba*(ayumi+1)
  if kaisuu=<hohaba:
    
    print(kouho_1)  else:
    if nokori%2==0:
      print(kouho_2)
    else:
      print(-kouho_3)

# Fixed code:
list = list(map(int, input().split())) 
hajime=list[0]
kaisuu=list[1]
hohaba=list[2]
if hajime>=0:
  ayumi=hajime//hohaba
  nokori=kaisuu-ayumi
  kouho_1=hajime-hohaba*kaisuu
  kouho_2=hajime-hohaba*ayumi
  kouho_3=hajime-hohaba*(ayumi+1)
 
  
  
  if kaisuu <= ayumi:
    print(kouho_1)
  else:
    if nokori%2==0:
      print(kouho_2)
    else:
      print(-kouho_3)
      
if hajime<0:  
  ayumi=-hajime//hohaba
  nokori=kaisuu-ayumi
  kouho_1=hajime+hohaba*kaisuu
  kouho_2=hajime+hohaba*ayumi
  kouho_3=hajime+hohaba*(ayumi+1)
  if kaisuu<=ayumi:
    
    print(-kouho_1)  
  else:
    if nokori%2==0:
      print(-kouho_2)
    else:
      print(kouho_3)
# Buggy code:
x,k,d = map(int, input().split())
x = abs(x)

walk = min(x,x//d)
k -= walk
x -= walk*d

if k%2 == 0:
    print(x)
else:
    print(d-x)


# Fixed code:
x,k,d = map(int, input().split())
x = abs(x)

walk = min(k,x//d)
k -= walk
x -= walk*d

if k%2 == 0:
    print(x)
else:
    print(d-x)
# Buggy code:
X, K,D = map(int, input().split())

if X >= K * D:
    print(X - K * D)
elif X <= K * (- D):
    print(abs(X + K * D))
else:
    if X >= 0:
        pos = X % D
        neg = X % D - D
        if K % 2 == (X // D) % 2:
            print(pos)
        else:
            print(abs(neg))
    if X <= 0:
        pos = D - (abs(X) % D)
        neg = - (abs(X) % D)
        if K % 2 == (X // D) % 2:
            print(abs(neg)
        else:
            print(pos))

# Fixed code:
X, K,D = map(int, input().split())

if X >= K * D:
    print(X - K * D)
elif X <= K * (- D):
    print(abs(X + K * D))
else:
    if X >= 0:
        pos = X % D
        neg = X % D - D
        if K % 2 == (X // D) % 2:
            print(pos)
        else:
            print(abs(neg))
    elif X <= 0:
        pos = D - (abs(X) % D)
        neg = - (abs(X) % D)
        if K % 2 == (abs(X) // D) % 2:
            print(abs(neg))
        else:
            print(pos)
# Buggy code:
x, k, d = map(int, input().split())

x, cnt = abs(x), abs(x) // d
if k % 2 == cnt % 2:
    ans = abs(x - d * min(k, cnt))
elif k % 2 != cnt % 2:
    ans = abs(x - d * min(k, cnt + 1)
print(ans)


# Fixed code:
x, k, d = map(int, input().split())

cnt = abs(x) // d
x = abs(x)
if k % 2 == cnt % 2:
    ans = min(abs(x - d * min(k,cnt)), abs(x + d * min(k,cnt)))
elif k % 2 != cnt % 2:
    ans = min(abs(x - d * min(k,(cnt + 1))), abs(x - d * min(k,(cnt + 1))))
print(ans)
# Buggy code:
X,K,D = list(map(int , input().split()))
ans = 0
if (X >=0):
    a = K*D
    if (X >= a):
        ans = X-a
    else:
        time = 0
        while (True):
            X -= D
            time += 1
            if X < 0:
                break
        nokori = (K- time) % 2
        ans = X + D*nokori
else:
    a = -(K*D)
    if (X <= a):
        ans = X-a
    else:
        time = 0
        while (True):
            X += D
            time += 1
            if X <0:
                break
        nokori = (K - time) % 2
        ans = X - D*nokori
print(ans)


# Fixed code:
X,K,D = list(map(int , input().split()))
ans = 0
if (X >=0):
    a = K*D
    if (X >= a):
        ans = X-a
    else:
        time = 0
        while (True):
            X -= D
            time += 1
            if X <= 0:
                break
        nokori = (K - time) % 2
        ans = X + D*nokori
else:
    a = -(K*D)
    if (X <= a):
        ans = X-a
    else:
        time = 0
        while (True):
            X += D
            time += 1
            if X >= 0:
                break
        nokori = (K - time) % 2
        ans = X - D*nokori
Answ = abs(ans)
print(Answ)
# Buggy code:
x,k,d = map(int,input().split())
ans = 0
if abs(x) >= k*d:
    ans = min(abs(x-k*d),abs(x+k*d))
else:
    b = abs(x)%d
    c = abs(x)//d
    if (k-c) %2 == 0:
        if x < 0:
            ans = -b
        else:
            ans = b
    else:
        if x < 0:
            ans = abs(b-d)
        else:
            ans = -abs(b-d)
print(ans)

# Fixed code:
x,k,d = map(int,input().split())
ans = 0
if abs(x) >= k*d:
    ans = min(abs(x-k*d),abs(x+k*d))
else:
    b = abs(x)%d
    c = abs(x)//d
    if (k-c) %2 == 0:
        if x < 0:
            ans = b
        else:
            ans = b
    else:
        if x < 0:
            ans = abs(b-d)
        else:
            ans = abs(b-d)
print(ans)
# Buggy code:
X,K,D = [int(x) for x in input().split()]

if abs(X) >= K * D:
    print(abs(X) - K * D)
else:
    K = K - int(abs(X) / D)
    X = int(abs(X) % D)
    if int(abs(X) % D) >= int(D / 2):
        if K % 2 == 0:
            print(X)
        else:
            print(D - X)
    else:
        print(X)

# Fixed code:
X,K,D = [int(x) for x in input().split()]

if abs(X) >= K * D:
    print(abs(X) - K * D)
else:
    K = K - int(abs(X) / D)
    X = int(abs(X) % D)
    if X >= int(D / 2):
        if K % 2 == 0:
            print(X)
        else:
            print(D - X)
    else:
        if K % 2 != 0:
            print(D - X)
        else:
            print(X)
# Buggy code:
#!/usr/bin/env python3
import sys


def solve(X: int, K: int, D: int):
    X=abs(X)

    ans=min(X, X - K * D)

    if K%2 == 1:
        X += D
        ans = min(ans, X)
    Kh=(K+1)//2

    N = X // (D*2)
    ans = min(ans, abs(X - D * 2 * (N - 1)))
    ans = min(ans, abs(X - D * 2 * N))
    if N < Kh:
        ans = min(ans, abs(X - D * 2 * (N+1)))

    print(ans)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(X, K, D)

if __name__ == '__main__':
    main()


# Fixed code:
#!/usr/bin/env python3
import sys


def solve(X: int, K: int, D: int):
    X=abs(X)

    mostl = X - K * D
    if mostl > 0:
        print(mostl)
        exit()

    if K%2 == 1:
        X -= D
        ans = min(abs(X), abs(X+2*D))
    else:
        ans = min(X, abs(X - K * D))

    Kh = K // 2

    N = X // (D*2)
    ans = min(ans, abs(X - D * 2 * (N - 1)))
    ans = min(ans, abs(X - D * 2 * N))
    if N < Kh:
        ans = min(ans, abs(X - D * 2 * (N + 1)))

    print(ans)

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(X, K, D)

if __name__ == '__main__':
    main()
# Buggy code:
x,k,d = map(int, input().split())
lists = []
 
step = int(x/d) 

if step >= k:
  answer = x - k * d
elif step < k:
  k_left = k - int(step)
  if k_left % 2 == 0:
    answer = x % d
  if k_left % 2 == 1:
    answer = abs(x - step * x - d)

print(answer)

# Fixed code:
x,k,d = map(int, input().split())
lists = []
x = abs(x)

step = int(x/d) 

if step >= k:
  answer = x - k * d
elif step < k:
  k_left = k - int(step)
  if k_left % 2 == 0:
    answer = x % d
  if k_left % 2 == 1:
    answer = abs(x - step * d - d)

print(answer)
# Buggy code:
X, K, D = map(int, input().split())

X = abs(X)

n = X // D
m = K - n

A1 = abs(X - n*D)
A2 = abs(X - (n+1)*D)

Ans = A2

if n+1 < K:
    if (A1 < A2 and m % 2 == 0) or (A1 > A2 and m % 2 != 0):
            Ans = A1
else:
    Ans = X - K*D

print(Ans)

# Fixed code:
X, K, D = map(int, input().split())

X = abs(X)

n = X // D
m = K - n

A1 = abs(X - n*D)
A2 = abs(X - (n+1)*D)

Ans = A2

if m > 1:
    if A1 <= A2:
        if m % 2 == 0:
            Ans = A1
    else:
        if m % 2 == 0:
            Ans = A1
else:
    Ans = abs(X - K*D)

print(Ans)
# Buggy code:
N = int(input())
a = list(map(int, input().split()))
#a = [list(map(int, list(input()))) for i in range(N + 1)]
# L, R, d = map(int, input().split())
cnt = 0
for i in range(0, N, 2):
    print(i)
    if a[i] % 2 != 0:
        cnt += 1
print(cnt)
        


# Fixed code:
N = int(input())
a = list(map(int, input().split()))
#a = [list(map(int, list(input()))) for i in range(N + 1)]
# L, R, d = map(int, input().split())
cnt = 0
for i in range(0, N, 2):

    if a[i] % 2 != 0:
        cnt += 1
print(cnt)
# Buggy code:
N=int(input())
a=map(int,input().split())

ans=0
for i in range(N):
    if i%2!=0 and a[i]%2!=0:
        ans+=1
        
print(ans)

# Fixed code:
N=int(input())
a=list(map(int,input().split()))
 
ans=0
for i in range(0,N,2):
    if a[i]%2!=0:
        ans+=1
        
print(ans)
# Buggy code:
N=int(input())
ai=list(map(int,input().split()))

ans=0

for i in range(N):
    if i%2==0:
        pass
    
    if ai[i] %2==1:
        ans+=1
print(ans)


# Fixed code:
N=int(input())
ai=list(map(int,input().split()))

ans=0

for i in range(N):
    if i%2==1:
        continue

    if ai[i] %2==1:
        ans+=1
print(ans)
# Buggy code:
print(sum([int(i)%2 for i in input().split()[1::2]]))

# Fixed code:
input()
print(sum([int(i)%2 for i in input().split()[::2]]))
# Buggy code:
mass=int(input())
number=list(map(int,input().split()))

cnt = 0

for i in mass:
    if (i+1)%2==0 and number[i]%2==0:
        cnt+=1
 print(cnt)

# Fixed code:
mass=int(input())
number=list(map(int,input().split()))

cnt = 0

for i in range(mass):
    if (i+1)%2!=0 and number[i]%2!=0:
        cnt+=1

print(cnt)
# Buggy code:
N = int(input())
A = list(map(int, input().split()))
ans = 0

for i, a in enumerate(A):
    if (i + a) % 2 == 1:
        ans += 1
print(ans)

# Fixed code:
N = int(input())
A = list(map(int, input().split()))
ans = 0

for i, a in enumerate(A):
    if (i % 2 == 0) and (a % 2 == 1):
        ans += 1
print(ans)
# Buggy code:
n=input()
l=list(map(int,input().split))
l.sort()
count=0
for i in range(n):
    if i%2==1 and l[i]%2==1:
        count += 1
print(count)

# Fixed code:
n=int(input())
l=list(map(int,input().split()))
count=0
for i in range(n):
    if i%2==0 and l[i]%2==1:
        count += 1
print(count)
# Buggy code:
n=int(input())
count=0
a=list(map(int,input().split()))
for i in range(len(a)-1):
    if a[i-1]%2!=0 and i%2!=0:
        count+=1
print(count)

# Fixed code:
n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
    if i % 2 == 0 and a[i] % 2 == 1:
        count += 1 
print(count)
# Buggy code:
N = int(input())
Mylist = input().split()
Mylist = [int(s) for s in Mylist]
ANS = 0
for i in range(N):
  if i+1 % 2 == 1 and Mylist[i] % 2 == 1:
    ANS += 1
print(ANS)

# Fixed code:
N = int(input())
Mylist = input().split()
Mylist = [int(s) for s in Mylist]
ANS = 0
for i in range(1,N+1):
  if i % 2 == 1 and Mylist[i-1] % 2 == 1:
    ANS += 1
print(ANS)
# Buggy code:
n = int(input())
s = list(map(int,input().split()[:n]))
a = 0
for i in range(1,len(s)):
  if((i%2 == 0) and (s[i]%2 !=0)):
    a+=1
print(a)


# Fixed code:
n = int(input())
s = list(map(int,input().split()))
a = 0
for i in range(n):
  if i%2 == 0 and s[i]%2 ==1:
    a+=1
print(a)
# Buggy code:
N = int(input())
ans = [int(a) for i, a in enumerate(input().split()) if i%2 == 0 and if a%2==1]

print(len(ans))

# Fixed code:
N = int(input())
a = [int(a) for i, a in enumerate(input().split()) if i%2 == 0]
ans = [i for i in a if i%2==1]
print(len(ans))
# Buggy code:
n = int(input())
lst = list(map(int, input().split()))
count = 0

for i in range(1, n + 1, 2):
  if lst[i] % 2 == 0:
    count += 1
    
print(count)

# Fixed code:
n = int(input())
lst = list(map(int, input().split()))
count = 0

for i in range(0, n, 2):
  if lst[i] % 2 != 0:
    count += 1
    
print(count)
# Buggy code:
n = int(input())
a = list(map(int, input().split()))
count = 0

for i in range(n):
  if (i + 1) % 2 == 0:
    if a[i] % 2 == 0: 
      count += 1
      
print(count)

# Fixed code:
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
    if a[i] % 2 == 1:
        ans += 1

print(ans)
# Buggy code:
n=input()
l=list(map(int,input().split()))
count=0
for i in range(n):
    if i%2==1 and l[i]%2==1:
        count += 1
print(count)

# Fixed code:
n = int(input())
l = list(map(int,input().split()))
cnt = 0
for i in range(n):
    if (i+1)%2==1 and l[i] %2 == 1:
        cnt += 1
print(cnt)
# Buggy code:
n = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(n//2):
    if a[2*i] % 2 == 1:
        ans += 1
print(ans)


# Fixed code:
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(0,n,2):
    if a[i]%2:
        ans += 1
print(ans)
# Buggy code:
N = int(input())
ai = [int(x) for x in input().split()]


c = 0

for i in range(N):
  if i % 2 == 1 and a[i] % 2 ==1:
    c += 1
  
print(c)

# Fixed code:
N = int(input())
a = [int(x) for x in input().split()]
 
c = 0

for i in range(N):
  if i % 2 == 0 and a[i] % 2 ==1:
    c += 1
print(c)
# Buggy code:
import math
import collections
import fractions
import itertools
import functools
import operator

def solve():
    n = int(input())
    a = list(map(int, input().split()))
    ans = 0
    for i in a:
        if i+1 % 2 == 0 and a[i] % 2 == 0:
            ans += 1
    print(ans)
    return 0

if __name__ == "__main__":
    solve()


# Fixed code:
import math
import collections
import fractions
import itertools
import functools
import operator

def solve():
    n = int(input())
    a = list(map(int, input().split()))
    ans = 0
    for i in range(n):
        if (i+1) % 2 == 1 and a[i] % 2 == 1:
            ans += 1
    print(ans)
    return 0

if __name__ == "__main__":
    solve()
# Buggy code:
n = int(input())
#a,b = map(int,input().split())
a_L = list(map(int,input().split()))

ans = 0
for i in range(n):
    if i%2!=0 and a_L[i] !=0:
        ans += 1

print(ans)

# Fixed code:
n = int(input())
#a,b = map(int,input().split())
a_L = list(map(int,input().split()))

ans = 0
for i in range(n):
    if (i+1)%2!=0 and a_L[i]%2 !=0:
        ans += 1

print(ans)
# Buggy code:
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
  if i%2==1 and a[i-1]%2==1:
    ans+=1
print(ans)

# Fixed code:

n=int(input())
a=list(map(int,input().split()))
cnt=0

for i in range(1,n+1,1):

    if i%2==1 and a[i-1]%2==1:
        cnt+=1

print(cnt)
# Buggy code:
n=map(int,input().split())
a=list(map(int,input().split()))

N=0
new_a=a[1::2]

for i in new_a:
    if i%22==0:
        N += 1

print(len(new_a)-N)

# Fixed code:
n=map(int,input().split())
a=list(map(int,input().split()))
 
N=0
new_a=a[::2]
 
for i in new_a:
    if i%2==0:
        N += 1
 
print(len(new_a)-N)
# Buggy code:
N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
    print(i)
    if (i%2 == 1) and (a[i-1]%2 == 1):
        ans += 1
print(ans)
    

# Fixed code:
N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
    if (i%2 == 1) and (a[i-1]%2 == 1):
        ans += 1
print(ans)
# Buggy code:
in_str = input()
N = int(in_str)
in_list = input().split(' ')
count = 0

for i in range(N):
    if i%2==0:
        print(i)
        if int(in_list[i])%2==1:
            count += 1
            print(i)
            print(count)

print(count)

# Fixed code:
in_str = input()
N = int(in_str)
in_list = input().split(' ')
count = 0

for i in range(N):
    if i%2==0:
        if int(in_list[i])%2==1:
            count += 1

print(count)
# Buggy code:
N = int(input())
arr = map(int, input().split())
count = 0

for i in range(1, len(arr) + 1, 2):
    if arr[i] % 2 != 0:
        count += 1
        
print(count)

# Fixed code:
N = int(input())
arr = tuple(map(int, input().split()))
count = 0

for i in range(0, N, 2):
    if arr[i] % 2 != 0:
        count += 1
        
print(count)
# Buggy code:
n = int(input())
ls = list(map(int, input().split()))

ans = 0
for i, ele in enumerate(ls):
    print(i+1, ele)
    if (i+1)%2 != 0:
        if ele%2 != 0:
            ans += 1
print(ans)

# Fixed code:
n = int(input())
ls = list(map(int, input().split()))

ans = 0
for i, ele in enumerate(ls):
    if (i+1)%2 != 0:
        if ele%2 != 0:
            ans += 1
print(ans)
# Buggy code:
n = int(input())
x = input().split()

masu_list = []
for i in range(n):
    if not i%2==0:
        masu_list.append(i)
    else:
        pass

answer_list=[]
for masu in masu_list:
    masu = masu-1
    answer_list.append(x[masu])

answer = [int(s) for s in answer_list]
answer_list_2=[]
for ans in answer:
    if not ans%2==0:
         answer_list_2.append(ans)
    else:
        pass
print(len(answer_list_2))

# Fixed code:
n = int(input())
x = input().split()

masu_list = []
for i in range(n):
    i=i+1
    if not i%2==0:
        masu_list.append(i)
    else:
        pass

answer_list=[]
for masu in masu_list:
    masu = masu-1
    answer_list.append(x[masu])

answer = [int(s) for s in answer_list]
answer_list_2=[]
for ans in answer:
    if not ans%2==0:
         answer_list_2.append(ans)
    else:
        pass
print(len(answer_list_2))
# Buggy code:
a=int(input())
lst=list(map(int,input().split()))
print(a,lst)
cnt=0
for i in range(0,a,2):
    if (lst[i] % 2==1) :
        cnt+=1
        print(i)
print(cnt)

# Fixed code:
a=int(input())
lst=list(map(int,input().split()))
cnt=0
for i in range(0,a,2):
    if (lst[i] % 2==1) :
        cnt+=1
print(cnt)
# Buggy code:
X = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(0,X,2):
    if A[i]%2!=0:
        ans+=1
for i in range(1,X,2):
    if A[i]%2==0:
        ans+=1

print(ans)


# Fixed code:
X = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(0,X,2):
    if A[i]%2!=0:
        ans+=1

print(ans)
# Buggy code:
N=int(input())
table=list(map(int,input().split()))
num=0
for i in table:
    if i%2==1 and (table[i])%2==1:
        num+=1
    print(num)


# Fixed code:
N=int(input())
table=list(map(int,input().split()))
num=0
for i in range(1,N+1):
    if i%2==1 and (table[i-1])%2==1:
        num+=1
print(num)
# Buggy code:
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(0,n,2):
	if a[i] % 2 == 1:
    	ans += 1
print(ans)

# Fixed code:
n = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(n):
  if i % 2 == 1:
    continue
  if a[i] % 2 == 1:
    ans += 1
print(ans)
# Buggy code:
n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(0,n.2):
  if a[i] % 2 == 1:
    count += 1
print(count)

# Fixed code:
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
  if i%2==0:
    if a[i]%2==1:
      ans+=1
print(ans)
# Buggy code:
s=input()
t=input()

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

print(count)

# Fixed code:
s = input()
t = input()
count =0
for i in range(len(s)):
    if s[i] != t[i]:
        count += 1
print(count)
# Buggy code:
a = input().split()
b = input().split()

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

# Fixed code:
a=input()
b=input()
cnt=0
for i in range(len(a)):
    if a[i]!=b[i]:
        cnt+=1



print(cnt)
# Buggy code:
S=string(input())
T=string(input())
num = 0
for i in len(S):
  if S[i] != T[i]:
    num= num+1
print(num)

# Fixed code:
S=input()  
T=input()
num = 0
for i in range(len(S)):
	if S[i] != T[i]:
		num= num+1
print(num)
# Buggy code:
S = list(input ())
T = list(input ())
a = len(S)
change_time = 0

for i in a:
  if (S[i] ==T[i])
  continue
  
  else:
  S[i] =T[i]
  change_time += 1
  
  
print(change_time)

# Fixed code:
S = list(input ())
T = list(input ())
a = len(S)
change_time = 0
 
for i in range(a):
  if S[i] ==T[i]:
  	continue
  
  else:
 
  	change_time += 1
  
  
print(change_time)
# Buggy code:
s = input()
t = input()
 
count = 0
 
for i in range(len(s))
if s[i] != t[i]:
  count += 1

print(count)

# Fixed code:
s = input()
t = input()
ans = 0

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

print(ans)
# Buggy code:
S = str(input())
T = str(input())

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

# Fixed code:
S = str(input())
T = str(input())
l = len(S)
count = 0
for i in range(l):
    if S[i] != T[i]:
        count += 1
print(count)
# Buggy code:
S = str(input())
T = str(input())
n = 0

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

print(n)

# Fixed code:
S = str(input())
T = str(input())
n = 0

for i in range(len(S)):
  if S[i] != T[i]:
    n += 1
    
print(n)
# Buggy code:
s  = input()
t = input()
result = len([a,b for a,b in zip(s,t) if a != b])
print(result)

# Fixed code:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)
# Buggy code:
S = input()
T = input()

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

# Fixed code:
S = input()
T = input()
cnt = 0
for i in range(len(S)):
    if S[i] != T[i] :
        cnt += 1
print(cnt)
# Buggy code:
s=input()
t=input()
a=0
for x in range(s):
  if s[x]!=t[x]:
    a+=1
print(a)

# Fixed code:
s=input()
t=input()
a=0
for x in range(len(s)):
  if s[x]!=t[x]:
    a+=1
print(a)
# Buggy code:
S=str(input())
T=str(input())
sum=0

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

print(sum)

# Fixed code:
S=str(input())
T=str(input())
sum=0

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

print(sum)
# Buggy code:
from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter

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

# Fixed code:
from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter

s=S()
t=S()
x=0
for i in range(len(s)):
    if s[i]!=t[i]:x+=1
print(x)
# Buggy code:
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str1[num])

    print(list(set(data)))

if __name__ == '__main__':
    MinorChange()

# Fixed code:
def MinorChange():

    str1 = str(input())
    str2 = str(input())

    data = []

    for num in range(len(str1)):
        if str1[num] != str2[num]:
            data.append(str2[num])

    print(len(data))

if __name__ == '__main__':
    MinorChange()
# Buggy code:
S = input()
T = input()
count = 0
for i in [:len(S)]:
  if S[i] != T[i]:
    count += 1
print(count)


# Fixed code:
S = str(input())
T = str(input())

count = 0
for i in range(len(S)):
    if S[i] != T[i]:
        count +=1
print(count)
# Buggy code:
S = input()
T = input()
for i in range(len(S)):
  if(S[i] != T[i]):
    ans += 1
print(str(ans))

# Fixed code:
S = input()
T = input()
ans = 0
for i in range(len(S)):
  if(S[i] != T[i]):
    ans += 1
print(str(ans))
# Buggy code:
s = input()
t = input()

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

# Fixed code:
s = input()
t = input()
ans = 0

for i in range(len(s)):
    if s[i] != t[i]:
        ans += 1
print(ans)
# Buggy code:
cnt=0
for i in range(len(s)):
    if s[i]!=t[i]:
        cnt+=1
print(cnt)

# Fixed code:
s=input()
t=input()

cnt=0

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

print(cnt)
# Buggy code:
S = input()
T = input()
ans = 0
for i in range(S):
  if S[i+1] == T[i+1]:
    ans += 1
print(ans)

# Fixed code:
S = input()
T = input()
ans = 0
for i in range(len(S)):
  if S[i] == T[i]:
    continue
  ans += 1

print(ans)