#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
#define INT long long
#define MOD 1000000007
#define oo 978654321
#define OO 9999999987654321ll
using namespace std;

int main()
{
    for(int i = 1 ; i <= 50 ; i++ )
    {
        char cmd[110];
        sprintf(cmd, "ren .%d.txt .%d.out", i, i);
        system(cmd);
    }
}

/*
string s;
int n, k, cnt[30], sum;
set<char> ss;

int main()
{
    ios::sync_with_stdio(false);
    cin>>s>>n;
    for(int i = 0 ; i < s.size() ; i++ )
        ss.insert(s[i]), cnt[s[i]-'a']++;
    sort(cnt, cnt+26, [](int x, int y){ return x > y; });
    for(int i = 0 ; i < n ; i++ ) sum += cnt[i];
    if( n > s.size()  ) cout<<"impossible";
    else if( ss.size() > n ) cout<<0;
    else cout<<n-ss.size();
    return 0;
}

/*
string s;
INT n, chk[100010], seg[100010];
vector<INT> ans[100010], G[100010];
set<INT> ss;
pair<INT, pair<INT, INT> > a[100010];
void dfs(int x, int y)
{
    chk[x] = 1;
    if( y != x ) ans[y].push_back(x+1);
    for(int v : G[x])
        if( !chk[v] )
            dfs(v, y);
}
int main()
{
    ios::sync_with_stdio(false);
    cin>>n;
    for(int i = 0 ; i < n ; i++ ) cin>>a[i].first, a[i].second.first = i;
    sort(a, a+n);
    for(int i = 0 ; i < n ; i++ ) a[i].second.second = i;
    sort(a, a+n, [](pair<INT, pair<INT, INT> > x, pair<INT, pair<INT, INT> > y){ return x.second.first < y.second.first; } );
    for(int i = 0 ; i < n ; i++ )
        G[i].push_back(a[i].second.second), G[a[i].second.second].push_back(i);
    for(int i = 0 ; i < n ; i++ )
        if( !chk[i] ) ans[i].push_back(i+1), dfs(i, i), ss.insert(i);
    cout<<ss.size()<<endl;
     for(int i : ss )
    {
        cout<<ans[i].size()<<" ";
        for(int j : ans[i] )
            cout<<j<<" ";
        cout<<endl;
    }
    return 0;
}
*/