Problem:
 Score : 200 points    Problem Statement The word internationalization is sometimes abbreviated to i18n .
This comes from the fact that there are 18 letters between the first i and the last n .  You are given a string s of length at least 3 consisting of lowercase English letters.
Abbreviate s in the same way.      Constraints  3 ≤ |s| ≤ 100 ( |s| denotes the length of s .)  s consists of lowercase English letters.         Input Input is given from Standard Input in the following format:  s       Output Print the abbreviation of s .        Sample Input 1 internationalization      Sample Output 1 i18n       Sample Input 2 smiles      Sample Output 2 s4s       Sample Input 3 xyz      Sample Output 3 x1z

Solution (Python):
s = list(input())

print(s[0] + str(len(s)-2) + s[len(s)-1])

Solution (Python):
a = list(input())
print(a[0]+ str(len(a)-2) +a[-1])

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
a=input()
print(a[0]+str(len(a)-2)+a[-1])

Solution (Python):
S = input()
t = str(len(S)-2)
print(S[0]+t+S[-1])

Solution (Python):
S = input()
print(S[0]+str(len(S)-2)+S[len(S)-1])

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
string = input()
list_string = list(string)
num = len(list_string)-2
str_num = str(num)
print(string[0] + str_num + string[-1])

Solution (Python):
N = input()

print(N[0]+str(len(N)-2)+N[len(N)-1])

Solution (Python):
a=input()
print(a[0]+str(len(a)-2)+a[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[len(s) - 1])

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
i_list = list(input())
print(i_list[0]+"{}".format(len(i_list)-2)+i_list[-1])

Solution (Python):
str_list = list(input())
length = len(str_list)
len_2 = str(length-2)
connect = ''.join([str_list[0],len_2,str_list[length-1]])
print(connect)

Solution (Python):
s = input()
print(str(s[0]) + str(len(s) - 2) + str(s[-1]))

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

s = list(ns())
f = s[0]
del s[0]
l = s[-1]
del s[-1]
print(f + str(len(s)) + l)

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
print(s[0]+str(len(s[1:len(s)-1]))+s[len(s)-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str((len(s) - 2)) + s[-1])

Solution (Python):
s = input()
print(s[0] + str((len(s)) - 2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
n = len(s) - 2
print(s[0] + str(n) + s[-1])

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

s = arr_data[0][0]

print(s[0] + str(len(s)-2) +  s[-1])

Solution (Python):
def main():
    s = input()
    res = s[0] + str(len(s[1:-1])) + s[-1]
    print(res)


if __name__ == "__main__":
    main()

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s = input()
answer = s[0]+str(len(s)-2)+s[-1]
print(answer)

Solution (Python):





if __name__ == '__main__':
    s = input()
    print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
l = input()
m = list(l)

a = m[0]
b = m[-1]
c = len(m) - 2

if (len(m)<3)or(len(m)>100):
    print("please input from 3~100")
else:
    print("{}{}{}".format(a,c,b))

Solution (Python):
s = input()
temp = len(s)-2
ans = s[0]+str(temp) +s[-1]
print(ans)

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[len(s)-1])

Solution (Python):
s = list(str(input()))
first = s[0]
last = s[-1]

s.pop(0)
s.pop()
u = len(s)

print(str(first) + str(u) + str(last))

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=input()
ans=[]
ans.append(s[0])
ans.append(str(len(s)-2))
ans.append(s[-1])
ans=''.join(ans)
print(ans)

Solution (Python):
s=input();print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s = input()
n = len(s) - 2
ans = s[0] + str(n) + s[-1]
print(ans)

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=input()

print(s[0],end="")
print(len(s)-2,end="")
print(s[-1])

Solution (Python):
s = input()
n = len(s)-2

print (s[0]+str(n)+s[-1:])

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=input()
l=len(s)-2
print(s[0]+str(l)+s[-1])

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
sent = input()
print(sent[0] + str(len(sent) - 2) + sent[-1])

Solution (Python):
s = input(); n = len(s)
print(s[0] + str(n-2) + s[n-1])

Solution (Python):
S=list(input())

print(S[0]+str(len(S)-2)+S[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
a = input()
print(a[0]+str(len(a)-2)+a[-1])

Solution (Python):
s = list(input())
print(s[0]+str(len(s[1:-1]))+s[-1])

Solution (Python):


import sys

s = sys.stdin.readline().strip()
l = len(s)
a = s[0] + str(l - 2) + s[-1]
print(a)

Solution (Python):


s = input()

print(s[0] + str(len(s[1:-1])) + s[-1])

Solution (Python):
s = input()
mae = s[:1]
usiro = s[-1:]
length = len(s) - 2
ans = mae + str(length) + usiro
print(ans)

Solution (Python):



s = input()
print(s[0], len(s)-2, s[-1], sep='')

Solution (Python):
s=input()
print(s[0] + str(len(s[1:len(s)-1]))+ s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[len(s)-1])

Solution (Python):
s=input()
print(s[0]+str(len(s[1:-1]))+s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s=input()
print(s[0]+str(len(s[1:][:-1]))+s[-1:])

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=str(input())
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=list(input())
s_i=len(s[1:-1])
print(s[0]+str(s_i)+s[-1])

Solution (Python):
s   = input()

head, mid, tail = s[0], s[1:-1], s[-1]

print(head + str(len(mid)) + tail)

Solution (Python):
s   = input()

head, mid, tail = s[0], s[1:-1], s[-1]

print(head + str(len(mid)) + tail)

Solution (Python):
inp = raw_input()
print inp[0] + str(len(inp) - 2) + inp[-1]

Solution (Python):
s = input()

print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):


S = input()
print("{}{}{}".format(S[0], len(S) - 2, S[-1]))

Solution (Python):
a = input()
b = len(a)
print(a[0] + str(b-2) + a[b-1])

Solution (Python):
a = input()

if len(a) < 3 or 100 < len(a):
    print(a)
else:
    print(a[0]+str(len(a)-2)+a[len(a)-1])

Solution (Python):
word = input()
num = len(word) - 2
word_list = list(word)

print(word_list[0]+str(num)+word_list[num+1])

Solution (Python):
s = input()

l = len(s)

print(s[0] + str(l-2) + s[l-1])

Solution (Python):


S = raw_input()
ls=len(S)

print S[0:1]+str(ls-2)+ S[ls-1:ls]

Solution (Python):
if __name__ == "__main__":
    S = input()
    print (S[0] + str(len(S) - 2) + S[-1])

Solution (Python):
s = str(input())
print(s[0] + str(len(s[1:-1])) + s[-1])

Solution (Python):
s = input()

n = len(s)
print(s[0] + str(n-2) + s[n-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()
print('{0}{1}{2}' .format(s[0],len(s)-2,s[len(s)-1]))

Solution (Python):
s = input()
num = len(s) - 2
print(s[0] + str(num) + s[-1])

Solution (Python):
S=raw_input()
print S[0]+str(len(S[1:-1]))+S[-1]

Solution (Python):
s = list(input())

print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
S = input()
print(S[0] + str(len(S[1:len(S)-1])) + S[-1])

Solution (Python):
s = raw_input()
print (s[0] + '%d' + s[-1]) % (len(s) - 2)

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=input()
ss=s[0]+str(len(s)-2)+s[-1]
print(ss)

Solution (Python):
value = input()
print("{}{}{}".format(value[0],len(value)-2,value[len(value)-1]))

Solution (Python):
value = input()
print("{}{}{}".format(value[0],len(value)-2,value[len(value)-1]))

Solution (Python):
s = input()

j = 0

for i in s:
    if j == 0:
        x = i
    z = i
    j = int(int(j) + 1)
y = int(int(j) - 2)

ans = str(str(x) + str(y) + str(z))
print(ans)

Solution (Python):
S = list(input())
N = len(S)
ans = S[0] + str(N - 2) + S[-1]
print(ans)

Solution (Python):
s = raw_input()
print s[0] + str(len(s) - 2) + s[-1]

Solution (Python):
s = input()
ans = s[0] + str(len(s)-2) + s[-1]
print(ans)

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = raw_input()
ans = s[0] + str(len(s) - 2) + s[-1]
print ans

Solution (Python):


s = input()

print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s = input()
a = len(s)
print('{0}{1}{2}'.format(s[0],a-2,s[-1]))

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = raw_input()
print(s[0] + str(len(s)-2) + s[len(s)-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
S = input()
memo = S[1:-1]
print(S[0],end = "")
print(len(memo),end = "")
print(S[-1])

Solution (Python):
x = input()
b = len(x) - 2
n =x[0] + str(b) + x[b+1]
print (n)

Solution (Python):

"""
http://abc069.contest.atcoder.jp/tasks/abc069_b

"""

def solve(text):
    text_length = len(text)
    return text[0] + str(text_length-2) + text[-1]

def main():
    S = input()
    result = solve(S)
    print(result)


if __name__ == '__main__':
    main()

Solution (Python):
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10


def main():
    s = input()
    print(s[0] + str(len(s) - 2) + s[-1])


if __name__ == '__main__':
    main()

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
l=list(input())
print("{0}{1}{2}".format(l[0], len(l)-2, l[-1]))

Solution (Python):
s = str(raw_input())
li = list(s)
a = li[0]
z = li[len(li)-1]
del li[0]
del li[len(li)-1]
print a+str(len(li))+z

Solution (Python):
s = input()
w = s[0]+str(len(s[:-2]))+s[-1]
print(w)

Solution (Python):
s = input()
s_s = s[0]
s_e = s[-1]
s = s[1:-1]

nw = s_s + str(len(s)) + s_e
print(nw)

Solution (Python):
st=input()
x=st[0]
y=st[len(st)-1]
n=str(len(st)-2)
ans=x+n+y
print(ans)

Solution (Python):
S = input()

res = S[0] + str(len(S) - 2) + S[-1]

print(res)

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
def solve(): 
    s = input()
    n_between = len(s) - 2
    shorten = [s[0], str(n_between), s[-1]]
    print("".join(shorten))


solve()

Solution (Python):
wen=list(input())
nagasa=str(len(wen[1:-1]))
print(wen[0] + nagasa + wen[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
x = input()
y = x[1:-1]
z = x[0]+str(len(y))+x[-1]
print(z)

Solution (Python):


s=input()
l=len(s)-2
print(s[0] + str(l) + s[-1])

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=str(input())
print(s[0]+str((len(s)-2))+s[len(s)-1])

Solution (Python):
s = raw_input()
print "%s%d%s" % (s[0], (len(s)-2), s[-1])

Solution (Python):
s=str(input())
print(s[0]+str((len(s)-2))+s[len(s)-1])

Solution (Python):
def main():
    s = input()
    print("{}{}{}".format(s[0], len(s[1:-1]), s[-1]))
    

if __name__ == "__main__":
    main()

Solution (Python):
s = raw_input()

st = s[0]
en = s[len(s) - 1]

ans = ""
ans += st
ans += str(len(s) - 2)
ans += en
print ans

Solution (Python):
def main():
    s = input()
    print(s[0] + str(len(s) - 2) + s[-1])

if __name__ == '__main__':
    main()

Solution (Python):
a = input()
print(a[0] + str(len(a) - 2) + a[-1])

Solution (Python):
s=input()
n=len(s)

print(s[0]+str(n-2)+ s[n-1])

Solution (Python):
s = input()

print (s[0] + str(len(s) - 2) + s[len(s)-1])

Solution (Python):
s=input()
print(s[:1]+str(len(s[1:len(s)-1]))+s[-1:])

Solution (Python):
a=input()
b=str(len(a[1:-1]))
c=str(a[:1])
d=str(a[-1])
print(c+b+d)

Solution (Python):
S = input()
print(S[0]+str(len(S[1:-1]))+S[-1])

Solution (Python):
S=list(input())
print(S[0]+str(len(S)-2)+S[-1])

Solution (Python):
ls = list(input())
print(ls[0] + str(len(ls)-2) + ls[-1])

Solution (Python):
s = str(input())
print(s[0]+str(len(s)-2)+s[len(s)-1])

Solution (Python):
s = input()
strlen = len(s)
print(s[0:1] + str(strlen-2) + s[-1])

Solution (Python):
s=input()

print(s[0]+str(len(s)-2)+s[len(s)-1])

Solution (Python):
a,*b,c=input();print(a+str(len(b))+c)

Solution (Python):
s=input()
l=len(s)
anser=s[0]+str(l-2)+s[l-1]
print(anser)

Solution (Python):
S = raw_input()

print "{}{}{}".format(S[0], len(S)-2, S[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) +s[len(s)-1])

Solution (Python):
if __name__ == '__main__':
    s = input()
    print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s[1:len(s) - 1])) + s[len(s) - 1])

Solution (Python):
s = input()
print (s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
print( s[0]+ str(len(s)-2) + s[-1])

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**9
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    s = S()

    return s[0] + str(len(s)-2) + s[-1]



print(main())

Solution (Python):
s = input()

n=len(s) - 2
print(s[0], end="")
print(n, end="")
print(s[-1])

Solution (Python):
S = input()
print(S[:1] + str(len(S) -2) + S[-1:])

Solution (Python):
s = input()
print(s[:1] + str(len(s) - 2) + s[-1:])

Solution (Python):
a = input()
print (a[0] + str((len(a) - 2)) + a[len(a) - 1])

Solution (Python):
sen = raw_input()
length = len(sen)
print(sen[0:1] + str(length - 2) + sen[length-1:length])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[len(s)-1])

Solution (Python):
S=input()
print(S[0]+str(len(S)-2)+S[-1])

Solution (Python):
l=raw_input()
n=len(l)-2
print l[0]+str(n)+l[-1]

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s = input().rstrip()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):

s = list(input())
a = s.pop(0)
b = s.pop()
print(a+str(len(s))+b)

Solution (Python):


s=raw_input()
print s[0]+str(len(s)-2)+s[-1]

Solution (Python):
s = input()

out = s[0]
out += str(s.__len__()-2)
out += s[s.__len__()-1]

print(out)

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()
print(s[0], end="")
print(len(s)-2, end="")
print(s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
li = list(s)

print(li[0] + str(len(li[1:-1])) + li[-1])

Solution (Python):
s = raw_input()
print s[0] + str(len(s)-2) + s[-1]

Solution (Python):
a=input()
print('%s%d%s'%(a[0],len(a)-2,a[-1]))

Solution (Python):



s = raw_input()
ans = s[0] + str(len(s)-2) + s[-1]
print ans

Solution (Python):
word = raw_input().strip()
print word[0] + str(len(word)-2) + word[-1]

Solution (Python):
S = input()
print(S[0]+str(len(S)-2)+S[-1])

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s = raw_input().rstrip()
print s[0] + str(len(s)-2)+s[-1]

Solution (Python):
s = input()
print(s[0]+str(len(s[1:len(s)-1]))+s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):


s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s=input()
n=len(s)
ans=s[0]+str(n-2)+s[n-1]
print(ans)

Solution (Python):
S = input()
ans = ""
ans += S[0]
ans += str(len(S[1:-1]))
ans += S[-1]
print(ans)

Solution (Python):
S = input()
print(S[0] + str(len(S)-2) + S[-1])

Solution (Python):
a = input()

a_len = len(a)
f = a[0]
e = a[-1]

print(f+str(a_len-2)+e)

Solution (Python):
import sys




def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    s = read_str()
    l = len(s)
    res = s[0] + str(l - 2) + s[-1]
    print(res)


main()

Solution (Python):

def Solution(s):
    len = s.__len__()
    return s[0] + (str)(len-2) + s[len-1]

if __name__=="__main__":
    input = raw_input()
    output = Solution(input)
    print output

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input().strip()
n = len(s)-2
print('{}{}{}'.format(s[0],n,s[-1]))

Solution (Python):
st = input()
length = len(st[1:-1])
print(st[0] + str(length) + st[-1])

Solution (Python):
s = input()
print(s[0],end = "")
print(len(s)-2,end = "")
print(s[-1])

Solution (Python):
word = input()
lists = list(word)
a = int(len(lists) -1)
print(lists[0]+str((int(len(lists))-2))+lists[a])

Solution (Python):
def omit(s):
    """
    @param: 元の文字列
    @return: 最初の文字 + 最初の文字と最後の文字にはさまれた文字列の流さ
    + 最後の文字

    >>> omit("internationalization")
    'i18n'

    >>> omit("smiles")
    's4s'

    >>> omit("xyz")
    'x1z'
    """

    s2 = list(s)

    (first,last) = (s2.pop(0), s2.pop(-1))
    return first + str(len(s2)) + last

print(omit(input()))

Solution (Python):
s = input()

print (s[0] + str(len(s) - 2) + s[len(s) - 1])

Solution (Python):
S = input()

S_list = list(S)
Len= len(S)
queue = []

queue.append(S_list[0])
queue.append(str(Len-2))
queue.append(S_list[Len-1])

print("".join(queue))

Solution (Python):
def main():
    S = input()
    
    len_S = len(S)
    print(S[0] + str(len_S - 2) + S[len_S - 1])
     
if __name__=="__main__":
    main()

Solution (Python):
temp = input()
l = len(temp)
print(temp[0]+str(l-2)+temp[l-1])

Solution (Python):
string=input('')
first=string[0]
last=string[len(string)-1]
mid=str(len(string[1:len(string)-1]))
print(first+mid+last)

Solution (Python):


S = input()
print(S[0] + str(len(S)-2) + S[-1])

Solution (Python):
chr = input()
chr_list = list(chr)
length = len(chr_list)

a, z =  chr_list[0], chr_list[length - 1]

print(a, length - 2, z, sep = '')

Solution (Python):
if __name__ == '__main__':
    S = input()
    STR = S[0:1] + str(len(S) - 2) + S[-1:]
    print(STR)

Solution (Python):
a=input().split()
b=list(a[0])
c=b[0]
d=b[-1]
l=len(b)-2
l=str(l)
print(c+l+d)

Solution (Python):
S = input()

print(S[0],len(S)-2,S[len(S)-1], sep='')

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
S = input()
print(S[0] + str(len(S[1:-1])) + S[-1:])

Solution (Python):
s=input()
print(s[0]+str(len(s)-2)+s[len(s)-1])

Solution (Python):
n = list(input())
c = len(n)
i = str(c-2)
a = [n[0],i,n[-1]]
print(''.join(a))

Solution (Python):
s = input()
print(s[0]+str(len(s[1:-1]))+s[-1])

Solution (Python):
s = input()

print( s[0] + str(len(s[1:-1])) + s[-1] )

Solution (Python):
n = input()
returnStr = n[0] + str(len(n)-2) + n[-1]
print(returnStr)

Solution (Python):
string = input()
cnt = 0
le = len(string)
for i in range(1,le-1):
    cnt =cnt +1
print(string[0],cnt,string[le-1],sep ='')

Solution (Python):


a=input()
b=len(a)
ans=b-2
print(a[0]+str(ans)+a[-1])

Solution (Python):
chars=input()

f=chars[0]
l=chars[len(chars)-1]

n=str(len(chars)-2)

print(f+n+l)

Solution (Python):
import sys


def main():
    word = sys.stdin.readline().strip()
    print(word[0] + str(len(word) - 2) + word[len(word) - 1])

main()

Solution (Python):
s=input()

L=len(s)-2
M=str(L)

A=s[0]+M+s[-1]
print(A)

Solution (Python):
s = input()

init = s[0]
last = s[-1]
l = len(s) - 2

print(init + str(l) + last)

Solution (Python):


s = raw_input()
print s[0] + str(len(s[1:-1])) + s[-1]

Solution (Python):
s = input()

print(s[0] + str(len(s[1:-1])) + s[-1])

Solution (Python):


import sys

def main(argv):
    for line in sys.stdin:
        s = line.rstrip("\n")
        print("{0}{1}{2}".format(s[0], len(s) - 2, s[-1]))

if __name__ == "__main__":
    main(sys.argv)

Solution (Python):
s = str(input())

print( s[0] + str(len(s)-2) + s[-1] )

Solution (Python):
S=input ()
p=S[0]
p+=str(len(S)-2)
p+=S[-1]
print (p)

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
temp= input()
l = len(temp)
srted = temp[0] + str(len(temp)-2) +temp[-1]
print(srted)

Solution (Python):

s = str(input())
x = list(s)

e = x.pop()
a = x.pop(0)

print(a,len(x),e,sep='')

Solution (Python):
s = raw_input()

print s[0]+str(len(s)-2)+s[-1]

Solution (Python):

S = input()
length = len(S)
st = length - 2
print(S[0:1] + str(st) + S[-1])

Solution (Python):
S = input()
print(S[0] + str(len(S[1:-1])) + S[len(S) - 1])

Solution (Python):
s = raw_input()
s = s[0] + str(len(s)-2) + s[-1]
print(s)

Solution (Python):
nm = input()
l = len(nm)
print(nm[0] + str(l - 2) +nm[-1])

Solution (Python):
s=raw_input().strip()
n=len(s)-2
print ''.join([s[0],'%i'%n,s[-1]])

Solution (Python):


word = input()

print(word[0] + str(len(word)-2) + word[-1])

Solution (Python):
s=str(input())
print(str(s[0])+str(len(s)-2)+str(s[-1]))

Solution (Python):
s = input()
print(s[0] + str(len(s[1:-1])) + s[-1])

Solution (Python):
words = input()
l = len(words)
output = words[0] + str(l-2) + words[l-1]
print(output)

Solution (Python):



def main():
    s = input()

    print("{0}{1}{2}".format(s[0], len(s) - 2, s[-1]))


if __name__ == "__main__":
    main()

Solution (Python):
'''input
xyz
'''
s = raw_input()
print s[0]+str(len(s[1:-1]))+s[-1]

Solution (Python):
def main():
    S = input()

    num = len(S) - 2
    ans = S[0] + str(num) + S[-1]
    print(ans)

main()

Solution (Python):
line = input().strip()

if len(line) > 2:
    n = len(line[1:-1])
    print(line[0] + str(n) + line[-1])
else:
    print(line)

Solution (Python):
s = input()
num_s = len(s)
print(s[0]+str(num_s-2)+s[-1])

Solution (Python):
def b():
    s = input()
    print(s[0] + str(len(s) - 2) + s[-1])

b()

Solution (Python):
s = input()
l = len(s)

head = s[0]
tail = s[len(s)-1]
an = l - 2
print(head + str(an) + tail)

Solution (Python):
s = list(input())
l = len(s) - 2
print(s[0] + str(l) + s[l+1])

Solution (Python):
s = input()

length = len(s)
ans = s[0] + str(length - 2) + s[-1]
print(ans)

Solution (Python):



s = raw_input()

n = len(s)

ans = s[0] + str(n-2) + s[n-1]

print ans

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
n = len(s)-2
print(s[0]+str(n)+s[-1])

Solution (Python):
s = input()

print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s = input()
m = len(s) - 2
print(s[0] + str(m) +s[-1])

Solution (Python):
s = str(input())
print(s[0] + str(len(s) - 2) + str(s[len(s) - 1]))

Solution (Python):
s = input()
print("{0}{1}{2}".format(s[0],len(s) - 2,s[-1]))

Solution (Python):
a = raw_input()
print a[0] + str(len(a)-2) + a[-1]

Solution (Python):
S = input()
l = len(S) - 2
ans = S[0] + str(l) + S[-1]
print(ans)

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):

s = input()

print(s[0]+ str(len(s)-2) +s[-1] )

Solution (Python):

 
def main():
	s = input()
	out = s[0] + str(len(s) - 2) + s[-1]
	print(out)
		
if __name__ == '__main__':
	main()

Solution (Python):
s = list(raw_input())
print s[0] + str(len(s) - 2) + s[len(s) - 1]

Solution (Python):
s=input()
ans=s[0]+str(len(s[1:-1]))+s[-1]
print(ans)

Solution (Python):
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
s=input()
s=s[0]+str(len(s[1:-1]))+s[-1]
print(s)

Solution (Python):
s = input()
print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
S=str(input())
print(S[0]+str(len(S)-2)+S[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + s[-1])

Solution (Python):
s=raw_input()
print s[0]+str(len(s)-2)+s[-1]

Solution (Python):
s = input()

print(s[0] + str(len(s)-2) + s[-1])

Solution (Python):
s = input()

ans = s[0]
ans += str(len(s) - 2)
ans += s[len(s) - 1]

print(ans)

Solution (Python):



import sys
import re
import math
import collections
import itertools
import functools

DEBUG = True
DEBUG = False

def dbg(*args):
    if DEBUG:
        print("DBG: ", file=sys.stderr, end="")
        print(*args, file=sys.stderr)



def main():
    s = input()
    print(s[0] + str(len(s)-2) + s[-1])

if __name__ == "__main__": main()

Solution (Python):
s = input()
N = len(s)
print(s[0] + str(N - 2) + s[N - 1])