def isPrime(n):
return not any([ n % i == 0 for i in range(2, int(n**0.5)+1) ])
def main():
output = []
sample_array = [-35, 5, 7, 19, 23, 21, 5, 3, 8, -11, 13, 5, 3, 15, 11, 13, 17, 13, 11, 23]
new_array = True
for i in sample_array:
if i < 2 or not isPrime(i):
new_array = True
continue
if new_array:
output.append(list())
new_array = False
output[-1].append(i)
if len(output) == 0:
return f"No existed prime in string"
print(output)
for array in output.copy():
for i in range(len(array)-1):
if array[i] < array[i+1]:
output.remove(array)
break
output = min(output, key=lambda x: len(x))
return output
print(main())