1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
def solution(n, lost, reserve):
    count = 0

    for i in lost :

        temp_1 = i-1 #1
        temp_2 = i+1 #3
        le_reserve = len(reserve) #2
        if temp_1 in reserve :
            count = count+1
            reserve.remove(temp_1)




        elif temp_2 in reserve :
            reserve.remove(temp_2)
            count = count+1




    answer = 0
    answer = n-len(lost)+count


    return answer