#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAX 55
using namespace std;
int a[55];
int n;
int ans;
int st[5];
int p;
int iabs(int x)
{
if (x >= 0) return x;
return -x;
}
int main()
{
while(scanf("%d",&n) != EOF)
{
for (int i = 0; i < n; ++i)
scanf("%d",&a[i]);
sort(a,a + n);
ans = 0;
p = 0;
for (int i = 0; i < n; ++i)
{
if (p == 0)
st[++p] = a[i];
else if (st[p] == a[i])
continue;
else if (iabs(st[p] - a[i]) > 1)
{
p = 1;st[p] = a[i];
}
else
{
st[++p] = a[i];
if (p == 3)
{
ans++;p = 0;
}
}
}
printf("%d\n",ans);
}
return 0;
}