#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<queue>
#include<functional>
#include<algorithm>
#define ms0(a) memset(a,0,sizeof(a))
#define ms1(a) memset(a,-1,sizeof(a))
#define pb(a) push_back(a)
using namespace std;
//typedef __int64 ll;
//const double Eps = (double)1e-8;
const int M = 1e9+7;
const int N = 3e5+5;
//int t1[10],t2[10]

int main()
{
    int a[105];
    int n;
    while(cin>>n)
    {
        for(int i=0;i<n;i++)
            cin>>a[i];
        sort(a,a+n);
        int k;
        cin>>k;
        int x= 0;
        int y = 1;
        for(int i = 1; i< n ;i++)
           {
                if(a[i] == a[i-1])
                    x++;
                else
                    y++;
           }
           if(k<= x)
            cout<<y<<endl;
           else
            cout<< y - (k - x) <<endl;
    }
}