def solution(A): if len(A)>2 : A.sort(reverse=True) for i in range(2,len(A)): if A[i-1] + A[i] > A[i-2]: return 1 else : continue return 0