20250821
/*
#include <stdio.h>
#include <string.h>
int queue[201]={};
int bback=0;
int ffront=0;
int ssize=200;
int cnt=0;
void push(int a)
{
cnt++;
queue[bback]=a;
bback = (bback+1)%ssize;
}
void pop()
{
if(ffront==bback&& cnt==0) return ;
ffront = (ffront+1)%ssize;
cnt--;
}
void front()
{
if(ffront==bback) printf("-1\n");
else printf("%d\n",queue[ffront]);
}
void back()
{
if(ffront==bback) printf("-1\n");
else printf("%d\n",queue[(bback-1+ssize)%ssize]);
}
void size()
{
printf("%d\n", cnt);
}
void empty()
{
if(ffront==bback && cnt==0) printf("true\n");
else printf("false\n");
}
int main()
{
int n;
char c[201]={};
scanf("%d",&n);
getchar();
for(int i=0;i<n;i++)
{
gets(c);
if(c[0]=='p'&&c[1]=='u')
{
int num;
sscanf(c, "push( %d", &num);
push(num);
}
else if(c[0]=='p'&&c[1]=='o')
{
pop();
}
else if(c[0]=='f')
{
front();
}
else if(c[0]=='b')
{
back();
}
else if(c[0]=='s')
{
size();
}
else if(c[0]=='e')
{
empty();
}
}
return 0;
}
*/
/*
//버블 정렬
#include <stdio.h>
int a[10001];
int n, i, j, temp;
int main()
{
scanf("%d", &n);
for (i=1; i<=n; i++)
scanf("%d", &a[i]);
for(i=1; i<n; i++)
{
for(j=1; j<=n-i; j++)
{
if (a[j] > a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
for (i = 1; i <= n; i++)
printf("%d\n", a[i]);
return 0;
}
*/
//3011번
#include <stdio.h>
int main()
{
int a[1001];
int n, i, j, temp;
int swap=0;
scanf("%d", &n);
for (i=1; i<=n; i++)
scanf("%d", &a[i]);
for(i=1; i<n; i++)
{
for(j=1; j<=n-i; j++)
{
if (a[j] > a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
swap++;
}
}
if(swap==0)
{
break;
}
swap=0;
}
printf("%d",i-1);
return 0;
}