y总思路 python
n = int(input())
a = input()
b = input()
f = [[float('inf')for i in range(3)]for i in range(n+1)]
f[n][1] = 0
for i in range(n-1,-1,-1):
for j in range(3):
for k in range(-9,10):
for t in range(3):
if int(a[i]) + k + t -1 - int(b[i]) == (j-1)*10:
f[i][j] = min(f[i][j],f[i+1][t] + abs(k))
print(min(f[0][0:3]))