#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
  if (n <= 1) return false;
  for (long long i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
long long fact[1000007] = {0};
long long expo(long long x, long long y) {
  long long res = 1;
  x = x % 1000000009;
  while (y > 0) {
    if (y & 1) res = (1ll * res * x) % 1000000009;
    y = y >> 1;
    x = (1ll * x * x) % 1000000009;
  }
  return res;
}
void facto() {
  fact[0] = 1;
  fact[1] = 1;
  for (long long i = 2; i < 100007; i++)
    fact[i] = (fact[i - 1] * i) % 1000000009;
}
long long npr(long long n, long long r) {
  facto();
  long long res = 1;
  res = fact[n];
  res = (res * (expo(fact[n - r], 1000000009 - 2))) % 1000000009;
  return res;
}
int main() {
  long long n;
  cin >> n;
  vector<long long> v;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    v.push_back(a[i]);
  }
  sort(v.begin(), v.end());
  sort(a, a + n);
  long long i = 0, j = 1;
  long long cnt = 0;
  while (i < n && j < n) {
    if (a[j] > a[i]) {
      cnt++;
      i++;
      j++;
    } else {
      j++;
    }
  }
  cout << cnt << "\n";
}
