def solution(A): A = sorted(A) ans = 1 for i in range(0, len(A)): if A[i] == ans: ans += 1 else: break if ans == len(A)+1: return 1 return 0