20240118 | 특수목적코딩학원 광교본점

# def prime(p):

# t = 2

# k = 1

# if p < 2:

# return 0

# while t * t <= p:

# if p % t == 0:

# k = 0

# break

# t += 1

# return k

# def solution(numbers):

# answer = 0

# k = len(numbers)

# numb = [0] * k

# for i in range(k):

# numb[i] = ord(numbers[i]) - 48

# numb.sort()

# q = 0

# for i in range(k):

# if i > 0 and numb[i] == numb[i - 1]:

# continue

# if prime(numb[i]) == 1:

# answer += 1

# if k > 1:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 2:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 3:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 4:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# for i5 in range(k):

# if i1 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i2 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i3 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i4 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i5 > 0 and numb[i5] == numb[i5 - 1]:

# continue

# q = 10 * q + numb[i5]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 5:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# for i5 in range(k):

# if i1 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i2 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i3 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i4 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i5 > 0 and numb[i5] == numb[i5 - 1]:

# continue

# q = 10 * q + numb[i5]

# for i6 in range(k):

# if i1 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i2 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i3 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i4 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i5 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i6 > 0 and numb[i6] == numb[i6 - 1]:

# continue

# q = 10 * q + numb[i6]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 6:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# for i5 in range(k):

# if i1 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i2 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i3 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i4 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i5 > 0 and numb[i5] == numb[i5 - 1]:

# continue

# q = 10 * q + numb[i5]

# for i6 in range(k):

# if i1 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i2 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i3 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i4 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i5 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i6 > 0 and numb[i6] == numb[i6 - 1]:

# continue

# q = 10 * q + numb[i6]

# for i7 in range(k):

# if i1 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i2 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i3 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i4 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i5 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i6 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i7 > 0 and numb[i7] == numb[i7 - 1]:

# continue

# q = 10 * q + numb[i7]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# return answer

# def solution(brown, yellow):

# answer = []

# i = 1

# while i * i <= yellow:

# if yellow % i != 0:

# i += 1

# continue

# k = yellow // i

# s = 2 k + 2 i + 4

# if s == brown:

# answer.append(k + 2)

# answer.append(i + 2)

# break

# i += 1

# return answer

# a, b = map(int, input().split())

# print(solution(a, b))

# def solution(k, dungeons):

# answer = -1

# l = len(dungeons)

# for i0 in range(l):

# q = 0

# q += dungeons[i0][0]

# if q <= k:

# if p < 1:

# p = 1

# if l > 1:

# for i1 in range(l):

# if i1 == i0:

# continue

# q += dungeons[i1][0]

# if q <= k:

# if p < 2:

# p = 2

# if l > 2:

# for i2 in range(l):

# if i2 == i0:

# continue

# if i2 == i1:

# continue

# q += dungeons[i2][0]

# if q <= k:

# if p < 3:

# p = 3

# if l > 3:

# return answer

# import copy

# def f(ar, n, p, v1):

# v1[p] = 1

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

# if v1[i] == 0 and ar[p][i] == 1:

# f(ar, n, i, v1)

# def solution(n, wires):

# answer = -1

# d = []

# asd = 0

# v1 = [0] * (n + 1)

# for i in range(n + 1):

# v = [0] * (n + 1)

# d.append(v)

# for i in range(n - 1):

# a1 = wires[i][0]

# a2 = wires[i][1]

# d[a1][a2] = 1

# d[a2][a1] = 1

# for i in range(n - 1):

# arr = copy.deepcopy(d)

# a1 = wires[i][0]

# a2 = wires[i][1]

# arr[a1][a2] = 0

# arr[a2][a1] = 0

# q = 0

# f(arr, n, 1, v1)

# for j in range(n + 1):

# if v1[j] == 1:

# q += 1

# if n - 2 * q > 0:

# if i == 0:

# asd = n - 2 * q

# elif asd > n - 2 * q:

# asd = n - 2 * q

# else:

# if i == 0:

# asd = 2 * q - n

# elif asd > 2 * q - n:

# asd = 2 * q - n

# for i in range(n + 1):

# v1[i] = 0

# answer = asd

# return answer

# wires = [[1,2],[2,7],[3,7],[3,4],[4,5],[6,7]]

# n = 7

# print(solution(n, wires))

# def solution(word):

# answer = 0

# n = len(word)

# if word[0] == 'A':

# answer += 1

# elif word[0] == 'E':

# answer += 782

# elif word[0] == 'I':

# answer += 1563

# elif word[0] == 'O':

# answer += 2344

# elif word[0] == 'U':

# answer += 3125

# if n > 1:

# if word[1] == 'A':

# answer += 1

# elif word[1] == 'E':

# answer += 157

# elif word[1] == 'I':

# answer += 313

# elif word[1] == 'O':

# answer += 469

# elif word[1] == 'U':

# answer += 625

# if n > 2:

# if word[2] == 'A':

# answer += 1

# elif word[2] == 'E':

# answer += 32

# elif word[2] == 'I':

# answer += 63

# elif word[2] == 'O':

# answer += 94

# elif word[2] == 'U':

# answer += 125

# if n > 3:

# if word[3] == 'A':

# answer += 1

# elif word[3] == 'E':

# answer += 7

# elif word[3] == 'I':

# answer += 13

# elif word[3] == 'O':

# answer += 19

# elif word[3] == 'U':

# answer += 25

# if n > 4:

# if word[4] == 'A':

# answer += 1

# elif word[4] == 'E':

# answer += 2

# elif word[4] == 'I':

# answer += 3

# elif word[4] == 'O':

# answer += 4

# elif word[4] == 'U':

# answer += 5

# return answer

# word = input()

# print(solution(word))

# def solution(k, dungeons):

# answer = -1

# p = 0

# n = len(dungeons)

# for i1 in range(n):

# h = k

# if dungeons[i1][0] > h:

# continue

# h -= dungeons[i1][1]

# if p < 1:

# p = 1

# if n > 1:

# for i2 in range(n):

# if i2 == i1:

# continue

# if dungeons[i2][0] > h:

# continue

# h -= dungeons[i2][1]

# if p < 2:

# p = 2

# if n > 2:

# for i3 in range(n):

# if i3 == i1:

# continue

# if i3 == i2:

# continue

# if dungeons[i3][0] > h:

# continue

# h -= dungeons[i3][1]

# if p < 3:

# p = 3

# if n > 3:

# for i4 in range(n):

# if i4 == i1:

# continue

# if i4 == i2:

# continue

# if i4 == i3:

# continue

# if dungeons[i4][0] > h:

# continue

# h -= dungeons[i4][1]

# if p < 4:

# p = 4

# if n > 4:

# for i5 in range(n):

# if i5 == i1:

# continue

# if i5 == i2:

# continue

# if i5 == i3:

# continue

# if i5 == i4:

# continue

# if dungeons[i5][0] > h:

# continue

# h -= dungeons[i5][1]

# if p < 5:

# p = 5

# if n > 5:

# for i6 in range(n):

# if i6 == i1:

# continue

# if i6 == i2:

# continue

# if i6 == i3:

# continue

# if i6 == i4:

# continue

# if i6 == i5:

# continue

# if dungeons[i6][0] > h:

# continue

# h -= dungeons[i6][1]

# if p < 6:

# p = 6

# if n > 6:

# for i7 in range(n):

# if i7 == i1:

# continue

# if i7 == i2:

# continue

# if i7 == i3:

# continue

# if i7 == i4:

# continue

# if i7 == i5:

# continue

# if i7 == i6:

# continue

# if dungeons[i7][0] > h:

# continue

# h -= dungeons[i7][1]

# if p < 7:

# p = 7

# if n > 7:

# for i8 in range(n):

# if i8 == i1:

# continue

# if i8 == i2:

# continue

# if i8 == i3:

# continue

# if i8 == i4:

# continue

# if i8 == i5:

# continue

# if i8 == i6:

# continue

# if i8 == i7:

# continue

# if dungeons[i8][0] > h:

# continue

# h -= dungeons[i8][1]

# if p < 8:

# p = 8

# h += dungeons[i7][1]

# h += dungeons[i6][1]

# h += dungeons[i5][1]

# h += dungeons[i4][1]

# h += dungeons[i3][1]

# h += dungeons[i2][1]

# h += dungeons[i1][1]

# answer = p

# return answer

# dungeons = [[80,20],[50,20],[30,10]]

# k = 50

# print(solution(k, dungeons))

# def prime(p):

# t = 2

# k = 1

# if p < 2:

# return 0

# while t * t <= p:

# if p % t == 0:

# k = 0

# break

# t += 1

# # print(p, k)

# return k

# def solution(numbers):

# answer = 0

# k = len(numbers)

# numb = [0] * k

# for i in range(k):

# numb[i] = ord(numbers[i]) - 48

# numb.sort()

# q = 0

# for i in range(k):

# if i > 0 and numb[i] == numb[i - 1]:

# continue

# if prime(numb[i]) == 1:

# answer += 1

# if k > 1:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 2:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 3:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 4:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# for i5 in range(k):

# if i1 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i2 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i3 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i4 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i5 > 0 and numb[i5] == numb[i5 - 1]:

# continue

# q = 10 * q + numb[i5]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 5:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# for i5 in range(k):

# if i1 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i2 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i3 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i4 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i5 > 0 and numb[i5] == numb[i5 - 1]:

# continue

# q = 10 * q + numb[i5]

# for i6 in range(k):

# if i1 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i2 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i3 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i4 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i5 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i6 > 0 and numb[i6] == numb[i6 - 1]:

# continue

# q = 10 * q + numb[i6]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# if k > 6:

# for i1 in range(k):

# if numb[i1] == 0:

# continue

# if i1 > 0 and numb[i1] == numb[i1 - 1]:

# continue

# q = numb[i1]

# for i2 in range(k):

# if i1 == i2 and ((i2 + 1 < k and numb[i2] != numb[i2 + 1]) or i2 + 1 == k):

# continue

# if i2 > 0 and numb[i2] == numb[i2 - 1]:

# continue

# q = 10 * q + numb[i2]

# for i3 in range(k):

# if i1 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i2 == i3 and ((i3 + 1 < k and numb[i3] != numb[i3 + 1]) or i3 + 1 == k):

# continue

# if i3 > 0 and numb[i3] == numb[i3 - 1]:

# continue

# q = 10 * q + numb[i3]

# for i4 in range(k):

# if i1 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i2 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i3 == i4 and ((i4 + 1 < k and numb[i4] != numb[i4 + 1]) or i4 + 1 == k):

# continue

# if i4 > 0 and numb[i4] == numb[i4 - 1]:

# continue

# q = 10 * q + numb[i4]

# for i5 in range(k):

# if i1 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i2 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i3 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i4 == i5 and ((i5 + 1 < k and numb[i5] != numb[i5 + 1]) or i5 + 1 == k):

# continue

# if i5 > 0 and numb[i5] == numb[i5 - 1]:

# continue

# q = 10 * q + numb[i5]

# for i6 in range(k):

# if i1 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i2 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i3 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i4 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i5 == i6 and ((i6 + 1 < k and numb[i6] != numb[i6 + 1]) or i6 + 1 == k):

# continue

# if i6 > 0 and numb[i6] == numb[i6 - 1]:

# continue

# q = 10 * q + numb[i6]

# for i7 in range(k):

# if i1 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i2 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i3 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i4 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i5 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i6 == i7 and ((i7 + 1 < k and numb[i7] != numb[i7 + 1]) or i7 + 1 == k):

# continue

# if i7 > 0 and numb[i7] == numb[i7 - 1]:

# continue

# q = 10 * q + numb[i7]

# if prime(q) == 1:

# answer += 1

# q = q // 10

# return answer

# numbers = input()

# print(solution(numbers))

def solution(n, lost, reserve):

answer = 0

k = len(lost)

l = len(reserve)

answer += n - k

for i in range(k):

for j in range(l):

if lost[i] == reserve[j]:

answer += 1

elif lost[i] - reserve[j] == 1:

answer += 1

reserve[j] = -1

lost[i] = -1

elif lost[i] - reserve[j] == -1:

answer += 1

reserve[j] = -1

lost[i] = -1

return answer

n = int(input())

lost = list(map(int, input().split()))

reverse = list(map(int, input().split()))

print(solution(n, lost, reverse))