#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
#define ll long long
#define N 1005
#define mem(a,t) memset(a,t,sizeof(a))
const double eps=1e-4;
const int mod=123456;
int a[N];
int main()
{
    //freopen("in.txt","r",stdin);
    int T,i,cnt,t,n,num;
    while(~scanf("%d",&n))
    {
        mem(a,0);
        num=cnt=0;
        for(i=0;i<n;i++)
        {
            scanf("%d",&t);
            if(!a[t])
            {
                a[t]=1;
                cnt++;
            }
            else
            {
                a[t]++;
                num++;
            }
        }
        int k,ans;
        scanf("%d",&k);
        if(k<=num)
            ans=cnt;
        else
        {
            ans=n-k;
        }
        printf("%d\n",ans);
    }
    return 0;
}