#include <iostream>
#include <algorithm>
#include "vector"
#include "string"
#include "set"
#include "unordered_set"
#include "unordered_map"
#include "queue"
#include "stack"
using namespace std;
bool validMountainArray(vector<int>& A)
{
int n = A.size(), i = 0, j = n - 1;
while (i + 1 < n && A[i] < A[i + 1]) i++;
while (j > 0 && A[j - 1] > A[j]) j--;
return i > 0 && j < n - 1 && i == j;
}
int main()
{
vector<int>nums1;
nums1.push_back(0);
nums1.push_back(3);
nums1.push_back(2);
nums1.push_back(1);
cout<<validMountainArray(nums1);
system("pause");
return 0;
}