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 = input()

ls= list(s)

print(ls[0]+str(len(s)-2)+ls[-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()
h = s[0]
t = s[-1]
n = str(len(s[1:-1]))

print(h+n+t)

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

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

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

Solution (Python):
s=input()
n=len(s)
print("{}{}{}".format(s[0],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[1:-1]))+s[-1])

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

Solution (Python):
s = input()

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

Solution (Python):
S = input()
l = str(len(S)-2)
print(S[0]+l+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()
l = len(s)
print(s[0]+str(l-2)+s[-1])

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

Solution (Python):
s = input()
n = len(s)
print(s[0] + str(n - 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[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 = input()
print(s[0]+str(len(s)-2)+s[-1])

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

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

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):
s = input().strip()
print(s[0]+str(len(s)-2)+s[-1])

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

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

Solution (Python):
x, *s ,y = input()
print(x+str(len(s))+y)

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):
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):
a = input()
print(a[0] + str(len(a[1:-1])) + a[-1])

Solution (Python):
def reducestr(s) : 
  return s[0] + str(len(s[1 : len(s) - 1])) + s[-1]

s = input()

print(reducestr(s))

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

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

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()
a = len(s) -2

m = list(s)

print(str(m[0]) + str(a) + str(m[-1]))

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

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)-2) + s[len(s)-1])

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

Solution (Python):

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

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

Solution (Python):


s = input()
s_length = str(len(s)-2)

print(s[0:1]+s_length+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 = str(input())
print(s[0],len(s)-2,s[-1],sep="")

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

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

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

Solution (Python):
s = input()
s1 = len(s) - 2
print(s[0] + str(s1) + 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("{0}{1}{2}".format(s[0], len(s)-2, s[-1]))

Solution (Python):
s,*t,r = input()
print(s+str(len(t))+r)

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

Solution (Python):
s = input()

head, *center, tail = s
print(head + str(len(center)) + tail)

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()
num=len(s)
print(s[0]+str(num-2)+s[num-1])

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

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

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

Solution (Python):
s = input()
m = str(len(s) -2)

print(s[0] + m + s[-1])

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

Solution (Python):
s = input()
m = str(len(s)-2)
print(s[0]+m+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 = input()
print(s[:1]+str(len(s)-2)+s[-1:])

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

Solution (Python):
s = input()
f = s[0]
e = s[-1]

print(f + str(len(s)-2) + e)

Solution (Python):

if __name__ == '__main__':
    a = input()


    print(a[0] + str(len(a)-2)+a[len(a)-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):
a, *b, c = input()
print(a + str(len(b)) + c)

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[len(s)-1])

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

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

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

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

Solution (Python):
s = list(input())
count = len(s)-2

print(s[0] + str(count) + s[-1])

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):
S=input();print(S[0]+str(len(S)-2)+S[-1])

Solution (Python):
s = input()
sl = len(s)
print(s[0]+str(sl-2)+s[sl-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:len(s)-1])) + s[-1])

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    n = len(s)
    print(s[0] + str(n-2) + s[-1])


if __name__ == "__main__":
    main()

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):
char = input()
length = len(char)

print('{}{}{}'.format(char[0], length-2, char[-1]))

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

Solution (Python):
s = input()
x = len(s)-2
print(s[0] + str(x) + 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()

x = len(S) - 2

print(S[0] + str(x) + S[-1])

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

l = len(s)-2

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

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

Solution (Python):
s=input()

fir=s[0]
las=s[-1]

s=s[1:]
s=s[:-1]

print(fir+str(len(s))+las)

Solution (Python):
s = 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[-1])

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

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

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

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)-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):
a = input()
print(a[0:1] + str(len(a) - 2) + a[len(a) - 1:len(a)])

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

Solution (Python):

s = input()
print("{}{}{}".format(s[:1], len(s[1:-1]), 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) - 2 ) + s[-1])

Solution (Python):
s = input()
t = 0
for i in range(1,len(s)-1):
    t += 1
print(s[0] + str(t) + s[len(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:-1]))+s[-1])

Solution (Python):
s = input()

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

Solution (Python):


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

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

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

Solution (Python):
s=list(input())
x=int(len(s))
print(s[0],x-2,s[x-1],sep="")

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):
import sys
s = list(sys.stdin.readline().rstrip("\n"))
i = s.pop(0)
f = s.pop(-1)
print(i+str(len(s))+f)

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

Solution (Python):
head, *body, tail = input()
print(''.join(map(str, (head, len(body), tail))))

Solution (Python):
S=input()
print(*[S[0],len(S)-2,S[-1]],sep='')

Solution (Python):
S = input()

num = len(S) - 2

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

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):
a,*b,c=input()
print(a+str(len(b))+c)

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

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    s = input().rstrip()

    ans = "".join([s[0], str(len(s) - 2), s[-1]])

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
t = len(s) - 2
print(s[0] + str(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[1:-1]))+s[-1])

Solution (Python):
s = input()
print(s[0] + str(len(s) - 2) + 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)-2)+s[-1])

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

Solution (Python):
a = input()
b = len(a)
print(a[0], end="")
print(b-2, end="")
print(a[b-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()
s1 = s[0]
s2 = s[-1]
l = len(s[1:-1])
print(s1+str(l)+s2)

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()
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 = input()
print(s[0]+str(len(s)-2)+s[-1])

Solution (Python):
code = input()


first_code = code[0]
last_code = code[len(code)-1]

print(first_code + str(len(code)-2) +last_code)

Solution (Python):
s = input()
print(s[:1] + 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):
s=input()
print(s[0]+str((len(s)-2))+s[-1])

Solution (Python):
import sys
import math
import bisect

def main():
    s = input()
    print('%s%d%s' % (s[0], len(s) - 2, s[-1]))
 
if __name__ == "__main__":
    main()

Solution (Python):


def main():
    s = input()

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

if __name__ == '__main__':
    main()

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
s = input()
S = len(s) - 2
print(s[0] + str(S) + 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 sys
s = sys.stdin.readline().rstrip()
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()
start = s[0]
end = s[-1]
length = str(len(s[1:-1]))
print(start + length + end)

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

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

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

print(ans)

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

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

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

print(result)

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

Solution (Python):
s = list(input())
first = s.pop(0)
last = s.pop(-1)
print(str(first)+str(len(s))+str(last))

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 = list(input())
c = int(len(s)) - 2
print(s[0] + str(c) + 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)-2) + s[-1])

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7

s = rs()
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)
print("{}{}{}".format(s[0],n-2,s[n-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 = input()
l = len(s) - 2

print(s[0], l, s[l + 1], sep = "")

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

cnt = 0
for i in range(1,len(s)-1):
    cnt += 1

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

Solution (Python):
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):
s = input()
print(s[:1] + str(len(s)-2) + s[-1:])

Solution (Python):
s = input()

a = [s[0],len(s)-2,s[len(s)-1]]

for i in range(3):
  print(a[i],end="")

Solution (Python):
def actual(s):
    head = s[0]
    tail = s[-1]
    length = len(s[1:-1])

    return '{}{}{}'.format(head, length, tail)  

    


s = input()

print(actual(s))

Solution (Python):
s = input()
long = len(s) - 2
print(s[0] + str(long) + 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 = 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()
if len(s) >=3:
    a = s[0] + str((len(s)-2)) + s[-1]
print(a)

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):
voca = input()
 
output = voca[0] + str(int(len(voca) - 2) )+ voca[-1]
 
print(output)

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

Solution (Python):
voca = input()

a = len(voca) - 2

output = voca[0] + str(a) + voca[-1]
 
print(output)

Solution (Python):
n=input()
print(n[0]+str(len(n)-2)+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(s[0]+str(len(s[1:-1]))+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):
a = 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):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,sqrt
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7


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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
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()
print(s[0]+str((len(s)-2))+s[-1])

Solution (Python):
S = input()

number = len(S)-2
print(''.join([S[0],str(number),S[-1]]))

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

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections


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

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

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

Solution (Python):
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    s =     _in[0]   
    
    _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 = input()
l = len(s)
print(s[0] + str(l-2) + s[-1])

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

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

apple = []
for i in s:
    apple.append(i)

a = apple.pop(0)
b = apple.pop(-1)
c = str(len(apple))
d = a + c + b
print(d)

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
s=list(input())
answer_list=[s[0]]+[str(len(s)-2)]+[s[-1]]
print("".join(answer_list))

Solution (Python):
def resolve():
	s = input()

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

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()
a = s[0]
b = s[-1]
long = len(s) - 2

print(a + str(long) + b)

Solution (Python):
S=input()
a=S[0]
b=S[-1]
c=len(S)-2
t=a+'%s' %c +b
print(t)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

Solution (Python):
S = str(input())
l = len(S)-1
n = len(S)-2
ans = S[0] + str(n) + S[l]
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[1:-1]))+s[-1])

Solution (Python):
s=input().rstrip()
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 resolve():
    
    n = input()
    
    
    
    
    
    
    
    
    i = len(n) -2

    print(n[0] + str(i) + n[-1])


resolve()

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=input()

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

print(a+str(c)+b)

Solution (Python):
s = input()

x = len(s)
y = x - 2

print(s[0] + str(y) + s[x-1])

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

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

A = n[0]
B = n[-1]

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

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

Solution (Python):
s=input()
z=str(len(s)-2)
print(str(s[0])+z+str(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[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)-2)+s[-1])

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

Solution (Python):
S = str(input())
l = int(len(S))


s1 = S[0]
s2 = S[-1]
L = int(l-2)

print(s1 + str(L) + s2)

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

rep_word = []
num_abb = len(word) - 2

rep_word.append(word[0])
rep_word.append(str(num_abb))
rep_word.append(word[-1])

print(''.join(rep_word))

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

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

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


if '__main__' == __name__:
    resolve()

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

Solution (Python):
s=input()
length = len(s)-2
print(s[0] + str(length) + s[length+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()
l=len(s)-2
t=s[0]+str(l)+s[l+1]
print(t)

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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[len(s)-1])

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input()
    res = ""
    cnt = 0
    for i in range(len(s)):
        if i == 0:
            res += s[i]
        elif i == len(s) - 1:
            res += str(cnt) + s[i]
        else:
            cnt += 1

    print(res)



if __name__ == '__main__':
    resolve()

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):
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[len(s) - 1])

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

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

print("%s%d%s" % (s[:1], 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=str(input())
print(S[0]+str(len(S)-2)+S[len(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 = input()
N = len(s)

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

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

Solution (Python):

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

Solution (Python):
text = input()
print(text[0] + str(len(text)-2) + text[-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())
x=len(s)
num=x-2
print(s[0]+str(num)+s[x-1])

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

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

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

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

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

Solution (Python):
s = input()
print(s[:1]+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()
a = s[0]
b = len(s) - 2
c = s[-1]

print(a+str(b)+c)

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

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

print(s[0]+w+s[-1])

Solution (Python):
s=input()
mojisuu=len(s)
tyuukanmojisuu=len(s)-2
s_list=list(s)
print("{}{}{}".format(s_list[0],tyuukanmojisuu,s_list[mojisuu-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):
arg=input()
print(arg[0]+str(len(arg)-2)+arg[-1])

Solution (Python):
moji = str(input())
start = moji[0]
length = len(moji)
end = moji[length - 1]
centre = length - 2
print(start + str(centre) + end)

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

Solution (Python):
s = input()
print(s[0],len(s[1:-1]),s[-1],sep='')

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

Solution (Python):
s = input()

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

print(''.join(ans))

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):
s = input()
a = str(len(s)-2)
print(s[0] + a + s[-1])

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

Solution (Python):
N=input()
A=len(N)

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

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

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

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