1 Best Cow Line
#include <iostream>
using namespace std;
#define MAX_N 2010
char S[MAX_N];
int n=0;
void solve()
{
int a = 0;
int b = n-1;
while(a<=b)
{
//abcdcba
bool left = false;
for(int i = 0;a+i<=b;i++)
{
if(S[a+i]<S[b-i]){
left=true;
break;
}
else if(S[a+i]>S[b-i]){
left=false;
break;
}
}
if(left)
putchar(S[a++]);
else
putchar(S[b--]);
}
putchar('\n');
}
int main()
{
scanf("%d",&n);
char ch = getchar();
for(int i=0;i<n;i++)
{
scanf("%c",&S[i]);
}
solve();
system("pause");
return 0;
}