def OUTPUT(n):
	print(n)

def DuvalFactorization(w, n):
	k = -1
	while k < n-1:
		i = k+1
		j = k+2
		while j < n and w[i] <= w[j]:
			if w[i] < w[j]:
				i = k+1
			else:
				i = i+1
			j = j+1
		while k < i:
			OUTPUT(k+1)
			k = k+j-i