#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;

int main() {
    int c;
    cin >> c;
    int total = 0;

    map<int, int> m;
    set<int> keys;

    while (cin >> c) {
        if ( keys.find(c) != keys.end() ) {
            total += m[c];
            m[c] = -1;
        } else {
            m[c] = -1;
            keys.insert(c);
        }

        vector<int> del;
        for (auto key : keys) {
            if (key < c)
                del.push_back(key);
            else
                m[key]++;
        }
        for (auto d : del)
            keys.erase(d);

    }

    cout << total << endl;

    return 0;
}