#include <bits/stdc++.h>
using namespace std;

#define BIT(x) (1ull << (x))
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) do {sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end());} while (0)
#define PB push_back
#define MP make_pair
#define SIZE(v) ((int)(v).size())
#define DEBUG(x) cout << #x << " = " << x << endl



int main()
{
	int n;
	vector<int> v = {-1e9 - 1, 1e9 + 1};
	scanf("%d", &n);
	REP(i, n){
		int a;
		scanf("%d", &a);
		v.PB(a);
	}
	sort(ALL(v));
	int res = 0;
	FOR(i, 1, n + 1){
		if (v[i - 1] != v[i] && v[i] != v[i + 1]){
			res++;
		}
	}
	printf("%d\n", res);
}