#include <cstdio>
#define Nmax 500005
#define MOD 9917
using namespace std;
int N,a[Nmax],aux[Nmax],sol;
inline void Merge(int st, int mij, int dr)
{
int i=st,j=mij+1;
aux[0]=0;
while(i<=mij && j<=dr)
{
if(a[i]<=a[j])
aux[++aux[0]]=a[i++];
else
{
sol=(sol+mij-i+1)%MOD;
aux[++aux[0]]=a[j++];
}
}
for(;i<=mij;++i)
aux[++aux[0]]=a[i];
for(;j<=dr;++j)
aux[++aux[0]]=a[j];
for(i=st;i<=dr;++i)
a[i]=aux[i-st+1];
}
inline void MergeSort(int st, int dr)
{
if(st==dr)
return;
int mij=(st+dr)/2;
MergeSort(st,mij); MergeSort(mij+1,dr);
Merge(st,mij,dr);
}
int main()
{
int i;
freopen ("inv.in","r",stdin);
freopen ("inv.out","w",stdout);
scanf("%d", &N);
for(i=1;i<=N;++i)
scanf("%d", &a[i]);
MergeSort(1,N);
printf("%d\n", sol);
return 0;
}
I2luY2x1ZGUgPGNzdGRpbz4KI2RlZmluZSBObWF4IDUwMDAwNQojZGVmaW5lIE1PRCA5OTE3CiAKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAppbnQgTixhW05tYXhdLGF1eFtObWF4XSxzb2w7CiAKaW5saW5lIHZvaWQgTWVyZ2UoaW50IHN0LCBpbnQgbWlqLCBpbnQgZHIpCnsKICAgIGludCBpPXN0LGo9bWlqKzE7CiAgICBhdXhbMF09MDsKICAgIHdoaWxlKGk8PW1paiAmJiBqPD1kcikKICAgIHsKICAgICAgICBpZihhW2ldPD1hW2pdKQogICAgICAgICAgICBhdXhbKythdXhbMF1dPWFbaSsrXTsKICAgICAgICBlbHNlCiAgICAgICAgewogICAgICAgICAgICBzb2w9KHNvbCttaWotaSsxKSVNT0Q7CiAgICAgICAgICAgIGF1eFsrK2F1eFswXV09YVtqKytdOwogICAgICAgIH0KICAgIH0KICAgIGZvcig7aTw9bWlqOysraSkKICAgICAgICBhdXhbKythdXhbMF1dPWFbaV07CiAgICBmb3IoO2o8PWRyOysraikKICAgICAgICBhdXhbKythdXhbMF1dPWFbal07CiAgICBmb3IoaT1zdDtpPD1kcjsrK2kpCiAgICAgICAgYVtpXT1hdXhbaS1zdCsxXTsKfQogCmlubGluZSB2b2lkIE1lcmdlU29ydChpbnQgc3QsIGludCBkcikKewogICAgaWYoc3Q9PWRyKQogICAgICAgIHJldHVybjsKICAgIGludCBtaWo9KHN0K2RyKS8yOwogICAgTWVyZ2VTb3J0KHN0LG1paik7IE1lcmdlU29ydChtaWorMSxkcik7CiAgICBNZXJnZShzdCxtaWosZHIpOwp9CiAKaW50IG1haW4oKQp7CiAgICBpbnQgaTsKICAgIGZyZW9wZW4gKCJpbnYuaW4iLCJyIixzdGRpbik7CiAgICBmcmVvcGVuICgiaW52Lm91dCIsInciLHN0ZG91dCk7CiAgICBzY2FuZigiJWQiLCAmTik7CiAgICBmb3IoaT0xO2k8PU47KytpKQogICAgICAgIHNjYW5mKCIlZCIsICZhW2ldKTsKICAgIE1lcmdlU29ydCgxLE4pOwogICAgcHJpbnRmKCIlZFxuIiwgc29sKTsKICAgIHJldHVybiAwOwp9