#include<iostream>

#include<stdio.h>

#include<string>

using namespace std;

int array[1000001];

//求旋转数组最小值

int MInArray(int *array,int n){

	int left = 0;

	int right = n - 1;

	int mid = 0;

	//二分查找最小值

	while(array[left] >= array[right]){

		//如果相邻right下标为最小值

		if(right - left == 1){

			mid = right;

			break;

		}

		mid = (left + right) / 2;

		//如果下标为left,right,mid的数值相等，只能顺序查找

		if(array[left] == array[right] && array[left] == array[mid]){

			int min = array[left];

			//顺序查找最小值

			for(int i = left + 1;i <= right;i++){

				if(min > array[i]){

					min = array[i];

				}

			}

			return min;

		}

		//mid 处于第一递增排序序列 最小值在mid后面

		if(array[mid] >= array[left]){

			left = mid;

		}

		//mid 处于第二递增排序序列 最小值在mid前面

		else if(array[mid] <= array[right]){

			right = mid;

		}

	}

	return array[mid];

}

int main()

{

	int i,n;

	while(scanf("%d",&n) != EOF){

		for(i = 0;i < n;i++){

			scanf("%d",&array[i]);

		}

		printf("%d\n",MInArray(array,n));

	}

    return 0;

}

public class RotatingArray {

     public int rotateArray(int a[]){

         int left=0;

         int mid=0;

         int right=a.length-1;

         while(a[left]>=a[right]){

             if((right-left)==1){

                 mid=right;

                 break;

            }

             mid=(left+right)/2;

             if(a[left]==a[mid]&&a[mid]==a[right]){

                 //只能用顺序查找最小值

                 int min=a[left];

                 for(int i=left;i<=right;i++){

                     if(a[i]<min)

                         min=a[i];

                 }

                return min;

             }

             if(a[mid]>=a[left])

                 left=mid;

             else if(a[mid]<=a[left])

                 right=mid;

         }

         return a[mid];

     }

     public static void main(String[] args){

         int[] a={4,5,6,1,2,3};

         RotatingArray ra=new RotatingArray();

         int min=ra.rotateArray(a);

         System.out.println(min+" ");

     }

}