#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int a[N];
int main() {
  int n;
  int ans = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  int p = 1;
  for (int i = 1; i <= n; i++) {
    while (p <= n && a[p] <= a[i]) p++;
    if (p == n + 1) break;
    ans++;
    p++;
  }
  printf("%d\n", ans);
  return 0;
}
