Best Cow Line

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<vector>
#include<string.h>
#include<map>
#include<cmath>
#include<set>
#define ll long long
#define maxn 1000001
#define ull unsigned long long
using namespace std;

int n;
char s[2021];
int main()
{
    while(~scanf("%d",&n))
    {
        memset(s,0,sizeof(s));
        for(int i=0;i<n;i++)
        {
            getchar();
            scanf("%c",&s[i]);
        }
        int u=0,v=n-1,ans=0,i;
        bool flag;
        while(u<=v)
        {
            flag=false;
            i=0;
            while(u+i<=v)
            {
                if(s[u+i]<s[v-i])
                {
                    flag=true;
                    break;
                }
                else if(s[u+i]>s[v-i])
                {
                    flag=false;
                    break;
                }i++;
            }
            if(flag) {printf("%c",s[u]);u++;}
            else {printf("%c",s[v]);v--;}
            ans++;
            if(ans==80)
            {
                printf("\n");
                ans=0;
            }
        }
        printf("\n");
    }
    return 0;
}