#include using namespace std; #include using namespace atcoder; using mint = modint1000000007; //using mint = modint998244353; //std::chrono::time_point start; template bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; } template bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; } #define ll long long #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) typedef pair P; ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; } ll lcm(ll a, ll b){return a * b / gcd(a, b);} template //contain(string s,string v) sにvが含まれるかを判定 bool contain(const std::basic_string& s, const U& v) { return s.find(v) != std::basic_string::npos; } int main(){ int n; cin>>n; vectorp(n); rep(i,n)cin>>p[i]; int ans=0; rep(i,n-1){ for(int j=i+1;j p[j])ans++; } } cout<