#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 10;
int n, m, a[N];
vector<int> g[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) g[rd()].push_back(i);
  int mx = 1e5 + 10, now = 0, cnt = 0;
  long long ans = 0;
  for (int i = 1; i <= mx; ++i)
    if (g[i].size()) {
      int sz = g[i].size(), pos = 0, pos2 = 0;
      for (int j = 0; j <= sz - 1; ++j) {
        if (g[i][j] > now)
          ans += cnt + 1, pos2 = g[i][j];
        else
          ans += cnt + 2, pos = g[i][j];
      }
      if (pos)
        ++cnt, now = pos;
      else
        now = pos2;
    }
  printf("%lld\n", ans);
}
