#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e18;
//const int mod = 2600000069;
//const int p = 179;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    cin.clear();
    string s;
    getline(cin, s);
    getline(cin, s);
//    s.resize(s.size() - 2);
//    if (s[s.size() - 1] == 'n' && s[s.size() - 1] == '\\') s.resize(s.size() - 2);
    string cur = "";
    int sz = s.size();
    int anssz = 0;
    for (int i = 0; i < s.size(); i++) {
        if (s[i] == ' ') {
            bool kek = 1;
            for (auto k : cur) {
                if (!((k >= 'a' && k <= 'z') || (k >= '0' && k <= '9') || k == '/' || k == ':' || k == '.')) {
                    kek = 0;
                    break;
                }
            }
            if (cur.size() < 7) kek = 0;
            else {
                if (cur.substr(0, 7) != "http://") kek = 0;
            }
            if (!kek) {
                cout << cur << " ";
                anssz += cur.size() + 1;
            } else {
                if (sz > n) {
                    if (sz - cur.size() + 3 >= n) {
                        sz = sz - cur.size() + 3;
                        cout << "... ";
                        anssz += 4;
                    } else {
                        for (int j = 0; j < n - (sz - cur.size() + 3); j++) {
                            cout << cur[j];
                            anssz++;
                        }
                        cout << "... ";
                        anssz += 4;
                        sz = n;
                    }
                } else {
                    cout << cur << " ";
                    anssz += cur.size() + 1;
                }
            }
            cur = "";
        } else {
            cur += s[i];
        }
    }
    bool kek = 1;
    for (auto k : cur) {
        if (!((k >= 'a' && k <= 'z') || (k >= '0' && k <= '9') || k == '/' || k == ':' || k == '.')) {
            kek = 0;
            break;
        }
    }
    if (cur.size() < 8) kek = 0;
    else {
        if (cur.substr(0, 7) != "http://") kek = 0;
    }
    if (!kek) {
        cout << cur;
        anssz += cur.size();
    } else {
        if (sz > n) {
            if (sz - cur.size() + 3 >= n) {
                sz = sz - cur.size() + 3;
                cout << "...";
                anssz += 3;
            } else {
                for (int j = 0; j < n - (sz - cur.size() + 3); j++) {
                    cout << cur[j];
                    anssz++;
                }
                cout << "...";
                anssz += 3;
                sz = n;
            }
        } else {
            cout << cur;
            anssz += cur.size();
        }
    }
    cur = "";
    cout << "\n" << max(anssz - n, 0LL);
}
/*
67
Visit http://olympiads.ru/zaoch/ and http://acm.timus.ru --- it's interesting.

30
Visit http://olympiads.ru/zaoch/ and http://acm.timus.ru --- it's interesting.
*/