////////
//////////BUBBLE SORT
////////#include <stdio.h>
////////#include <stdlib.h>
////////int main()
////////{
//////// int n,i,j,temp;
//////// int arr[101]={};
//////// scanf("%d", &n);
//////// for (i=1;i<=n;i++)
//////// {
//////// scanf("%d", &arr[i]);
//////// }
//////// for (i=1;i<n;i++)
//////// {
//////// for (j=1;j<=n-i;j++)
//////// {
//////// if (arr[j]>arr[j+1])
//////// {
//////// temp=arr[j];
//////// arr[j]=arr[j+1];
//////// arr[j+1]=temp;
//////// }
//////// }
//////// }
//////// for (i=1;i<=n;i++)
//////// {
//////// printf("%d ", arr[i]);
//////// }
//////// return 0;
////////}
//////
////////SELECTION SOR 선택정렬
////////#include <stdio.h>
////////
////////int main()
////////{
//////// int n,i,j,temp, min=1;
//////// int arr[101]= {};
//////// scanf("%d", &n);
//////// for (i=1; i<=n; i++)
//////// {
//////// scanf("%d", &arr[i]);
//////// }
//////// for (i=1; i<n; i++)
//////// {
//////// for(j=i; j<=n; j++)
//////// {
//////// if (arr[min]>arr[j])
//////// {
//////// min=j;
//////// }
//////// }
//////// temp=arr[i];
//////// arr[i]=arr[min];
//////// arr[min]=temp;
//////// min=i+1;
////////
//////// }
//////// for (i=1; i<=n; i++)
//////// {
//////// printf("%d ", arr[i]);
//////// }
//////// return 0;
////////}
//////// INSERTION SORT
//////#include <stdio.h>
//////int main()
//////{
////// int n,i,j,key;
////// int arr[101]= {};
////// scanf("%d", &n);
////// for (i=1; i<=n; i++)
////// {
////// scanf("%d", &arr[i]);
////// }
////// for (i=2; i<=n; i++)
////// {
////// key=arr[i];
////// for (j=i-1;j>=1;j--)
////// {
////// if (key<arr[j])
////// {
////// arr[j+1]=arr[j];
////// }
////// else
////// {
////// break;
////// }
////// }
////// arr[j+1]=key;
////// }
////// for (i=1; i<=n; i++)
////// {
////// printf("%d ", arr[i]);
////// }
//////}
//////#include <stdio.h>
////int main()
////{
//// int n,i,j,temp;
//// int arr[101]={};
//// scanf("%d", &n);
//// for (i=1;i<=n;i++)
//// {
//// scanf("%d", &arr[i]);
//// }
//// for (i=1;i<n;i++)
//// {
//// for(j=1;j<=n-i;j++)
//// {
//// if (arr[j]<arr[j+1])
//// {
//// temp=arr[j];
//// arr[j]=arr[j+1];
//// arr[j+1]=temp;
//// }
//// }
//// }
//// for (i=1;i<=n;i++)
//// {
//// printf("%d ", arr[i]);
//// }
////}
//#include <stdio.h>
//#include <string.h>
//struct student
//{
// char str[11];
// int sco;
//};
//int main()
//{
// int n,i,j;
// struct student p[51],temp;
// scanf("%d", &n);
// for (i=1;i<=n;i++)
// {
// scanf("%s %d", p[i].str,&p[i].sco);
// }
// for (i=1;i<n;i++)
// {
// for (j=1;j<=n-i;j++)
// {
// if (p[j].sco<p[j+1].sco)
// {
// temp=p[j];
// p[j]=p[j+1];
// p[j+1]=temp;
// }
// }
// }
// for (i=1;i<=n;i++)
// {
// printf("%s %d\n", p[i].str, p[i].sco);
// }
// printf("%s", p[3].str);
// return 0;
//}
#include <stdio.h>
int main()
{
int n,i,j,temp;
int arr[1001];
scanf("%d", &n);
for (i=1;i<=n;i++)
{
scanf("%d", &arr[i]);
}
for (i=1;i<n;i++)
{
for (j=1;j<=n-i;j++)
{
if (arr[j]>arr[j+1])
{
temp
}
}
}
}