>>> a = [0,1,2,3,5,6,4,7]
>>> a == sorted(a)
False
>>> a
[0, 1, 2, 3, 5, 6, 4, 7]
>>> if a != sorted(a):
	for i in zip(a, sorted(a)):
		if i[0] != i[1]:
			print(a.index(i[0]))
			break		
4

[1, 2, 3, 4, 5, 6, 7, 8, 9]
1<2
2<3

def is_sorted(arr):
    for i in range(1,len(arr)):
        if arr[i-1] > arr[i]:
            return arr[i]
    return True

import random
a=range(10001)
n=int(input('Vvedite kol-vo chlenov'))
for i in range(1, n+1):
    a[i]= random.randrange(10000)
print(a[i])
i=1
s=1
while s!= 0:
    if (a[i + 1]) < (a[i]):
        print('Первое число,нарушающее упорядоченность : ', a[i + 1])
    s=0
    i= i + 1
    if i == n:
        break
    if s != 0:
        print('Последовательность упорядочена')

>>> def f(seq):
...     assert len(seq) > 1
...     i = 1
...     while True:
...         if seq[i - 1] > seq[i]:
...             return i + 1
...         if seq[i] == 10000:
...             break
...         i += 1
...     return 0
... 
>>> f([1, 10000])
0
>>> f([1, 2, 10000])
0
>>> f([1, 2, 3, 10000])
0
>>> f([1, 2, 3, 1, 10000])
4
>>> f([1, 2, 3, 3, 10000])
0
>>> f([1, 2, 3, 10001, 10000])
5
>>>