#define _CRT_SECURE_NO_WARNINGS 1


//BC122 有序序列判断
#include  <stdio.h>
#include <stdlib.h>

int cmp(const void* s1, const void* s2)
{
    return (-(*(int*)s1 - *(int*)s2));
}

int main()
{
    int n = 0;
    int m = 0;
    int i = 0;
    int count1 = 0;
    int count = 0;
    int arr1[50] = { 0 };
    int arr2[50] = { 0 };
    scanf("%d", &n);
    int k = n;
    while (k--)
    {
        scanf("%d", &m);
        arr1[i] = m;
        arr2[i] = m;
        i++;
    }
    qsort(arr1, 50, sizeof(arr1[0]), cmp);
    for (int i = 0; i < n; i++)
    {
        if (arr1[i] != arr2[n-i-1])
        {
            count++;
            break;
        }
    }
    for (int i = 0; i < n; i++)
    {
        if (arr1[i] != arr2[i])
        {
            count1++;
            break;
        }
    }
    if (count == 0 || count1 == 0)
        printf("sorted");
    else
        printf("unsorted");
    return 0;
}




//BC123 有序序列插入一个整数



#include <stdio.h>
int main()
{
    int n = 0;
    int i = 0;
    int m = 0;
    int s = 0;
    int count = 0;
    int arr[51] = { 0 };
    scanf("%d", &n);
    int k = n;
    while (k--)
    {
        scanf("%d", &m);
        arr[i] = m;
        i++;
    }
    scanf("%d", &s);
    if (arr[0] > s)
    {
        int tmp = arr[0];
        arr[0] = s;
        s = tmp;
    }
    for (int j = 0; j < n; j++)
    {
        if ((s > arr[j] && s < arr[j + 1]) || arr[j + 1] == 0)
        {
            int tmp = arr[j + 1];
            arr[j + 1] = s;
            s = tmp;
        }
    }
    for (int i = 0; i < n + 1; i++)
        printf("%d ", arr[i]);
    return 0;
}