# The general idea is to scan the given sequence $A$ looking for
# subsequences of identical consecutive elements.  If the subsequence
# consists of one or two elements, then we simply print those element
# one by one, otherwise we print the element followed by the count.  We
# can do this with a linear scan of $A$.

# Tactically, we can proceed in a number of ways.  One simple and quite
# elegant way of doing that is to use two position indexes, $i$ and $j$,
# with $i<j$, where position $i$ indicates the /first/ element of the
# sequence, and $j$ indicates the last element.  In fact, it is even
# more convenient to use $j$ to indicate the the first element /past/
# the sequence, meaning the first element that differs from the elements
# of the sequence and therefore that terminates the sequence.

# Notice that $j$ can be the position of an element, or it can be the
# first position past the last element of the whole sequence.

def compress(A):
    i = 0
    while i < len(A):
        j = i + 1
        while j < len(A) and A[j] == A[i]:
            j = j + 1
        if j - i <= 2:
            for _ in range(j - i):
                print(A[i])
        else:
            print(A[i],'*',j - i)
        i = j

import sys
A = []
for l in sys.stdin:
    for a in l.strip().split():
        A.append(a)

compress(A)