#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x,y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
/*
                                            class Point{
                                            	public:
                                            	double x,y;
                                            	Point(double x=0,double y=0):x(x),y(y) {}
                                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                            	Point operator * (double a) {return Point(x*a,y*a);}
                                            	Point operator / (double a) {return Point(x/a,y/a);}
                                            	double absv() {return sqrt(norm());}
                                            	double norm() {return x*x+y*y;}
                                            	bool operator < (const Point &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const Point &p) const{
                                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                            	}
                                            };
                                            typedef Point Vector;
                                     #define pl pair<int,pas>
                                            struct Segment{
                                            Point p1,p2;
                                            };
                                             double dot(Vector a,Vector b){
                                            	return a.x*b.x+a.y*b.y;
                                            }
                                            double cross(Vector a,Vector b){
                                            	return a.x*b.y-a.y*b.x;
                                            }
                                        
                bool parareru(Point a,Point b,Point c,Point d){
                //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
                	return abs(cross(a-b,d-c))<EPS;
                }
                double distance_ls_p(Point a, Point b, Point c) {
                  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
                  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
                  return abs(cross(b-a, c-a)) / (b-a).absv();
                }
                bool is_intersected_ls(Segment a,Segment b) {
                	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
                	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
                //		cout<<"sss"<<endl;
                		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
                		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
                		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
                		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
                		return false;
                	}
                  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
                }
                 
                double segment_dis(Segment a,Segment b){
                	if(is_intersected_ls(a,b))return 0;
                	double r=distance_ls_p(a.p1, a.p2, b.p1);
                	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
                	return r;
                }
                Point intersection_ls(Segment a, Segment b) {
                  Point ba = b.p2-b.p1;
                  double d1 = abs(cross(ba, a.p1-b.p1));
                  double d2 = abs(cross(ba, a.p2-b.p1));
                  double t = d1 / (d1 + d2);
                 
                  return a.p1 + (a.p2-a.p1) * t;
                }
 */                
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                                double distans(double x1,double y1,double x2,double y2){
                                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                                	return sqrt(rr);
                                	
                                }
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
    
                                
                int pr[1000010];
                int inv[1000010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
    double bekid(double w,int r){
    	if(r==0) return 1.0;
    	if(r==1) return w;
    	if(r%2) return bekid(w,r-1)*w;
    	double f=bekid(w,r/2);
    	return f*f;
    }
                
    			int comb(int nn,int rr){
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                	for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
                	
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
    
                                     //----------------kokomade tenpure------------

//int d2[200020]={};
int d[3][200020]={};
int a[200020];
int ans[3][200020]={};
int n;
int rui[3][200020]={};
int dp[3][200020][21]={};
void solve(int q){
//	for(int i=1;i<=n;i++)cout<<d[q][i]<<" ";
//	cout<<endl;
	rui[q][0]=0;
	for(int i=1;i<=n;i++)rui[q][i]=rui[q][i-1]+d[q][i];
	ans[q][n]=0;
	int inff=inf*10000ll;
	d[q][n+1]=inff;
	for(int i=1;i<=n+1;i++)dp[q][i][0]=d[q][i];
	for(int i=1;i<=n+1;i++)dp[q][i][1]=max(d[q][i],d[q][i+1]);
	
	for(int k=2;k<=20;k++)for(int i=1;i<=n+1;i++){
		int e=i+(1<<(k-1));
		if(e<=n+1)dp[q][i][k]=max(dp[q][i][k-1],dp[q][i+(1<<(k-1))][k-1]);
		else dp[q][i][k]=dp[q][i][k-1];
	}
	
	for(int i=1;i<=20;i++)dp[q][n][i]=d[q][n+1];
	for(int i=n-1;i>=1;i--){
		if(d[q][i]<=d[q][i+1])ans[q][i]=ans[q][i+1];
		else{
			int ima=i+1;
			for(int k=20;k>=0;k--){
				if(dp[q][ima][k]>=d[q][i])continue;
				else{
					ima+=(1<<k);
				}
			}
			ima--;
		//	cout<<i<<" "<<ima<<endl;
			int kotae=ans[q][ima+1];
			int wa=rui[q][ima]-rui[q][i];
			kotae+=d[q][i]*(ima-i)-wa;
			ans[q][i]=kotae;
		
		}
	}
	//for(int i=1;i<=n;i++)cout<<ans[q][i]<<endl;
}
int aa[200020];
 signed main(){

  //  	       cin.tie(0);
  // 			ios::sync_with_stdio(false);

cin>>n;
 	for(int i=1;i<=n;i++){
 		cin>>a[i];
 		aa[n+1-i]=a[i];
 	}
 	for(int i=2;i<=n;i++){
 		if(a[i]==a[i-1]){
 			d[1][i]=d[1][i-1];
 		}
 		else if(a[i]>a[i-1]){
 			int r=a[i-1];
 		int cn=0;
 		while(r<a[i]){
 			cn++;
 			r*=4;
 		}
 			cn--;
 		d[1][i]=cn+d[1][i-1];
 		}
 		else{
 			int r=a[i];
 			int cn=0;
 			while(r<a[i-1]){
 			cn++;
 			r*=4;
 			}
 			d[1][i]=-cn+d[1][i-1];
 		}
 	}
 	
 	for(int i=2;i<=n;i++){
 		if(aa[i]==aa[i-1]){
 			d[2][i]=d[2][i-1];
 		}
 		else if(aa[i]>aa[i-1]){
 			int r=aa[i-1];
 		int cn=0;
 		while(r<aa[i]){
 			cn++;
 			r*=4;
 		}
 			cn--;
 		d[2][i]=cn+d[2][i-1];
 		}
 		else{
 			int r=aa[i];
 			int cn=0;
 			while(r<aa[i-1]){
 			cn++;
 			r*=4;
 			}
 			d[2][i]=-cn+d[2][i-1];
 		}
 	//	cout<<d[2][i]<<endl;
 	}
 	solve(1);
 	solve(2);
 	for(int i=1;i<=n/2;i++){
 		swap(ans[2][i],ans[2][n+1-i]);
 	}
 	
 	int ko=min(2*ans[1][1],2*ans[2][n]+n);
 //	cout<<ko<<endl;
 	for(int i=2;i<=n;i++){
// 		cout<<ans[1][i]<<" "<<ans[2][i-1]<<endl;
 		ko=min(ko,i-1+2*ans[1][i]+2*ans[2][i-1]);
 	}
 	cout<<ko<<endl;
 	return 0;
 	/*
 	for(int i=1;i<n;i++){
 		int r=a[i];
 		int cn=0;
 		while(r<a[i+1]){
 			cn++;
 			r*=4;
 		}
 		d2[i]=cn;
 	}
 	for(int i=1;i<=n;i++)cout<<d1[i]<<" ";
 	cout<<endl;
 	
 	for(int i=1;i<=n;i++)cout<<d2[i]<<" ";
 	cout<<endl;
 	cout<<endl;
 	
 	int ans=inf;
 	int ima=0;
 	for(int i=2;i<=n;i++){
 		ima+=d1[i]*(n-i+1)*2;
 	}
 	
 	ans=ima;
 	int mi=ima;
 	int hi=0;
 	for(int i=2;i<=n;i++){
 	int ch=i-1;
 		mi-=d1[i]*(n-i+1)*2;
 		hi+=d2[i-2]*(i-2)*2;
 		cout<<i<<" "<<ch<<" "<<mi<<" "<<hi<<endl;
 		ans=min(ans,mi+hi+ch);
 	}
 	cout<<ans<<endl;
 	*/
 	return 0;
  }


Measured memory_bytes: 85760