#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair

const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};

typedef unsigned long long ull;
typedef std::pair<int,int> P;

int main(){
    std::string s;
    while(std::getline(std::cin, s), s != "END OF INPUT"){
        s += " ";
        int prev_pos = 0, pos = 0;
        while(pos = s.find(" ", pos), pos != std::string::npos){
            printf("%d", pos - prev_pos);
            prev_pos = pos + 1;
            pos += 1;
        }
        puts("");
    }
}