一本通1113

#include <bits/stdc++.h>
#define rep(i,j,n) for(register int i=j;i<=n;i++)
#define Rep(i,j,n) for(register int i=j;i>=n;i--)
#define low(x) x&(-x)
using namespace std ;
typedef long long LL ;
const int inf = INT_MAX >> 1 ;
inline LL In() { LL res(0) , f(1) ; register char c ;
#define gc c = getchar()
    while(isspace(gc)) ; c == '-' ? f = - 1 , gc : 0 ;
    while(res = (res << 1) + (res << 3) + (c & 15) , isdigit(gc)) ;
    return res * f ;
#undef gc
}

int n ;
const int N = 100 + 5 ;
LL a[N] ;
LL sum(0) ;
inline void Ot() {
	n = In() ;
	rep(i,1,n) a[i] = In() ;
	LL maxn = -inf ;
	rep(i,1,n) maxn = max(maxn , a[i]) ;
	rep(i,1,n) a[i] == maxn ? 0 : sum += a[i] ;
	cout << sum << endl ;
}
signed main() {
//  freopen("test.in","r",stdin) ;
    return Ot() , 0 ;
}