/* https://www.facebook.com/shanroy1999/posts/2795036240730237
Subscribed by : Shantanu Roy(shan.roy1999@gmail.com) */

import java.util.Scanner;

class Bitonic_Array
{
    public static int isBitonic(int arr[], int N) 
    {
        if (arr[0] > arr[1])
            return -1;

        int i, j;
        for (i = 2; i < N; i++) { 
            if (arr[i - 1] >= arr[i]) {
                break;
            }
        } 

        if (i == N - 1) {
            return 1; 
        }
    
        for (j = i + 1; j < N; j++) {
            if (arr[j - 1] <= arr[j]) {
                break;
            }
        } 
        
        if (j != N) {
            return -1;
        }
    
        return 1;
    } 

    public static void main(String args[])
    {
        System.out.println("Enter number of elements in array");
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        System.out.println("Enter elements of array");
        int[] arr = new int[N];
        for (int i = 0; i < N; i++) {
            arr[i] = sc.nextInt();
        }
        int ans = isBitonic(arr, N);
        if (ans == -1)
            System.out.println("The array is not bitonic");
        else
            System.out.println("The array is bitonic");
    }
}

/*
Input:
N = 5
arr = {0, 1, 2, 3, 4}
Output:
The array is not bitonic
Input:
N = 5
arr = {0, 2, 4, 3, 1}
Output:
The array is bitonic
Input:
N = 5
arr = {4, 3, 2, 1, 0}
Output:
The array is not bitonic
*/