def sum_three_smallest_nums(lst):
	
	return sum(sorted([x for x in lst if x > 0])[:3])
def is_not_prime(n):
    import math
    
    result = False
    for i in range(2,int(math.sqrt(n)) + 1):
        if n % i == 0:
            result = True
    return result