#include<bits/stdc++.h>
using namespace std;
const int N = 1000010;
int cnt[N];
long long arr[N];
int main() {
int n;
cin>>n;
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i < n; i++) {
int foo;
cin>>foo;
cnt[foo]++;
}
arr[0] = 0;
for (int i = 1; i < N; i++) {
arr[i] = (long long)i * cnt[i];
if (i - 2 >= 0) {
arr[i] += arr[i - 2];
}
if (arr[i - 1] > arr[i]) {
arr[i] = arr[i - 1];
}
}
cout << arr[N - 1] << endl;
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBOID0gMTAwMDAxMDsKCmludCBjbnRbTl07CmxvbmcgbG9uZyBhcnJbTl07CgppbnQgbWFpbigpIHsKICBpbnQgbjsKIGNpbj4+bjsKICBtZW1zZXQoY250LCAwLCBzaXplb2YoY250KSk7CiAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgIGludCBmb287CiAgICBjaW4+PmZvbzsKICAgIGNudFtmb29dKys7CiAgfQogIGFyclswXSA9IDA7CiAgZm9yIChpbnQgaSA9IDE7IGkgPCBOOyBpKyspIHsKICAgIGFycltpXSA9IChsb25nIGxvbmcpaSAqIGNudFtpXTsKICAgIGlmIChpIC0gMiA+PSAwKSB7CiAgICAgIGFycltpXSArPSBhcnJbaSAtIDJdOwogICAgfQogICAgaWYgKGFycltpIC0gMV0gPiBhcnJbaV0pIHsKICAgICAgYXJyW2ldID0gYXJyW2kgLSAxXTsKICAgIH0KICB9CiAgY291dCA8PCBhcnJbTiAtIDFdIDw8IGVuZGw7CiAgcmV0dXJuIDA7Cn0=