#include<iostream>
#include<stack>
#include<queue>
#include<map>
#include<memory.h>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<iomanip>
using namespace std;
const int maxn = 1010;
int arr[maxn];
int main()
{
int n = 0;
while (cin >> n&&n)
{
while (1)
{
stack<int> sta;
cin >> arr[1];
if (arr[1] == 0)
break;
for (int i = 2; i <= n; i++)
cin >> arr[i];
int A = 1, B = 1;
int ok = 1;
while (B <= n)
{
if (arr[B] == A){ A++; B++; }
else if (!sta.empty() && sta.top() == arr[B]){ B++; sta.pop(); }
else if (A <= n)sta.push(A++);
else { ok = 0; break; }
}
printf("%s\n", ok ? "Yes" : "No");
}
cout << endl;
}
}
04-29
1267