def mindist(x,m,p):

n=len(x)

min_dis=-9999

for i in range(n):

for j in range(i+1,n):

if m==x[i] and p==x[j] or \

m==x[j] and p==x[i] and abs(j - i) > min_dis:

min_dis = abs(j - i)

return min_dis

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

m=1

p=4

print(mindist(x,1,4))