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

int main() {
    int k;
    string s;
    string kq;

    cin >> k;
    cin >> s;

    int dodai = s.length();

    if (k < 1 || k > 100)
        return 0;

    if (dodai < 1 || dodai > 100)
        return 0;

    for (int i = 0; i < k; ++i)
    {
        if (k > dodai)
        {
            cout << s;
            return 0;
        }
        if (s[i] >= 'a' && s[i] <= 'z')
            kq += s[i];
        else
            return 0;
    }

    if (k < dodai)
        kq += "...";

    cout << kq;

    return 0;
}
#include <bits/stdc++.h>

using namespace std;
 
//#define int long long
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)

ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
 
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

int main(){
    ios_base::sync_with_stdio(false);
    ll k;
    string s;
    cin >> k >> s;
    if(s.size()<=k){
        cout << s << endl;
    }else{
        for(int i=0;i<k;i++){
            cout << s[i];
        }
        cout << "..." << endl;
    }
    return 0;
}
