N = gets.to_i
a_list = gets.strip.split(/ /).collect{|n| n.to_i}

count_p_list = [0] * N
count_p = 0
prev_p = a_list[-1]
gap_p_list = []

count_n_list = [0, 1]
count_n = 1
prev_n = a_list[0] * -2
gap_n_list = []

(1...N).each{|i|
	a_p = a_list[N - 1 - i]
	while prev_p < a_p
		if gap_p_list.length > 0
			gap = gap_p_list[-1]
			gap_i, gap_n = gap
			count_p += (i - gap_i) * 2
			if gap_n == 1
				gap_p_list.pop
			else
				gap[1] = gap_n - 1
			end
		else
			count_p += i * 2
		end
		prev_p *= 4
	end
	n = 0
	t = 4
	while prev_p >= a_p * t
		t *= 4
		n += 1
	end
	if n > 0
		gap_p_list << [i, n]
	end
	prev_p = a_p
	count_p_list[N - 1 - i] = count_p
	
	a_n = a_list[i] * -2
	count_n += 1
	while prev_n > a_n
		if gap_n_list.length > 0
			gap = gap_n_list[-1]
			gap_i, gap_n = gap
			count_n += (i - gap_i) * 2
			if gap_n == 1
				gap_n_list.pop
			else
				gap[1] = gap_n - 1
			end
		else
			count_n += i * 2
		end
		prev_n *= 4
	end
	n = 0
	t = 4
	while prev_n <= a_n * t
		t *= 4
		n += 1
	end
	if n > 0
		gap_n_list << [i, n]
	end
	prev_n = a_n
	count_n_list << count_n
}

#p count_p_list
#p gap_p_list
#p count_n_list
#p gap_n_list

min = nil
(0...N).each{|i|
	count = count_n_list[i] + count_p_list[i]
	if min == nil || count < min
		min = count
	end
}
puts min

