ABC 436

void solve() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N;
    cin >> N;
    vll B(N);
    rep(i, N) {
        cin >> B[i];
        B[i]--;
    }

    // number, id
    using P = pair<ll, ll>;
    vector<P> ps;
    rep(i, N) ps.emplace_back(B[i], i);
    sort(rall(ps), [](P a, P b) -> bool {
        return a.first < b.first;
    });

    fenwick_tree<ll> fw(N);
    rep(i, N) fw.add(i, 1);

    ll ans = 0;
    for (auto [_, id] : ps) {
        ll l = 1, r = 1;
        if (0 < id) {
            l += fw.sum(0, id);
        }
        if (id + 1 < N) {
            r += fw.sum(id + 1, N);
        }
        ans += l * r;
        fw.add(id, -1);
    }
    cout << ans << endl;
}