#include <stdio.h>
#include <stdlib.h>

struct list
{
    int data;
    struct list * nextPtr;
};
typedef struct list *listNode;

void insert(listNode *sPtr, int value)
{
    listNode newPtr;
    newPtr = (listNode)malloc(sizeof(listNode));
    newPtr->data = value;
    newPtr->nextPtr = *sPtr;
    *sPtr = newPtr;
}
int main()
{
    listNode startPtr = NULL;
    int number, *value, i, mark;

    while ((scanf("%d", &number)) == 1 && number != 0)
    {
        value = (int *)malloc(sizeof(int)*number);
        while ((scanf("%d", &value[0])) && value[0] != 0)
        {
            for (i = 1; i < number; i ++)
                scanf("%d", &value[i]);
            mark = number;
            i = number - 1;
            while (mark)
            {
                insert(&startPtr, value[i]);
                while (startPtr != NULL && startPtr->data == mark)
                {
                    startPtr = startPtr->nextPtr;
                    mark --;
                }
                i --;
                if (i == -1)
                    break;
            }
            if (mark == 0)
                printf("Yes\n");
            else
                printf("No\n");
        }
        printf("\n");
        free(value);
    }

    return 0;
}