#import <Foundation/Foundation.h>

 int find_maximum(NSMutableArray *arr, int jk ,int n) {
  
  int c, max, index;
  max = [[arr objectAtIndex:jk] intValue] ;
  index = 0;
  for (c = jk; c < n; c++) {
    if ([[arr objectAtIndex:c] intValue] > max) {
       index = c;
       max = [[arr objectAtIndex:c] intValue];
    }
  }
  return max;
}

NSMutableArray * solve( NSMutableArray *inputArr)
{
    int n = inputArr.count;
   
    int count=0,j;
    NSMutableArray *b = [NSMutableArray array];
    for(int k = 0; k <= n-1; k++){
        for(int i = 0; i <= n-k-1; i++){
            j = i + k;
            [b addObject:[NSNumber numberWithInt:find_maximum(inputArr,i,j)]];
        } 
    } 
    return b;
}
int sumOfArray(NSMutableArray *ArrAddition)
{
    int sum =0;
    for(int h = 0; h < ArrAddition.count; h++) {
        int val = [[ArrAddition objectAtIndex:h] intValue];
        sum = (sum  + val);
    } 
    return sum;
}
int main(int argc, const char * argv[]) {
    NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];
    int n;
    scanf("%i",&n);
    int a[n];
    NSMutableArray *aN = [NSMutableArray array];
    for(int a_i = 0; a_i < n; a_i++){
        scanf("%i",&a[a_i]);
    }
    
    for(int m = 0; m < n; m++){
        [aN addObject:[NSNumber numberWithInt:a[m]]];
    }
    NSMutableArray *sofArray = solve(aN);
     for(int h = 0; h < sofArray.count; h++) {
        int val = [[sofArray objectAtIndex:h] intValue];
                 printf("%i",val);

    } 
    NSMutableArray *sofsarray= solve(sofArray);
        printf("\n");

    for(int h = 0; h < sofsarray.count; h++) {
        int val = [[sofsarray objectAtIndex:h] intValue];
        printf("%i",val);
    } 
    
    [pool drain];
    return 0;
}