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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=STR()
    print(s[0]+str(len(s)-2)+s[-1])
if __name__ == '__main__':
    do()

Solution (Python):
s = input()

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

print(ans)

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

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

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

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

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

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

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

l = len(a)

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

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

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

Solution (Python):
S = input()
print(S[0] + str(int(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] + 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()

counter = 0
for i in s:
    counter += 1

counter = counter - 2

print(s[0] + str(counter) + 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):
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()
Ss = S[0]
Sc = len(S)-2
Se = S[-1]
print(Ss+str(Sc)+Se)

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

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

Solution (Python):
S = input()

L = len(S) -2

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

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

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

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

Solution (Python):
s = input()


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

print(s1)

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

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

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

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys
input = sys.stdin.readline
s=input().strip()
ans=s[0]
ans+=str(len(s)-2)
ans+=s[-1]
print(ans)

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

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

Solution (Python):



s = input()
slist = list(s)

leng = len(slist) - 2

sf = slist[0]
se = slist[-1]

result = sf + str(leng) + se

print(result)

Solution (Python):


import numpy as np

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

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

Solution (Python):
s=input()
n=len(s)
t=s[0]+str(n-2)+s[n-1]
print(''.join(map(str,t)))

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

Solution (Python):
s = input()

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

print(new_s)

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

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

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

Solution (Python):
def main(s: str):
    print(s[0], len(s) - 2, s[-1], sep="")


if __name__ == "__main__":
    s = input()

    main(s)

Solution (Python):


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

Solution (Python):




def solver(inputStr) :
    top =  inputStr[0]
    middle = len(inputStr)-2
    endChar = inputStr[-1]
    return top,middle,endChar


if __name__=="__main__" :
    answer1=''
    answer2=0
    answer3=''
    S = input()
    answer1,answer2,answer3= solver(S)
    print(answer1,answer2,answer3,sep='')

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

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

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

Solution (Python):


s = input()

num = len(s)

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

Solution (Python):
s = str(input())
lst = []
lst.append(s[0])
lst.append(str(len(s)-2))
lst.append(s[-1])

print(''.join(lst))

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

Solution (Python):
S = input()

Sstart = S[0]
Send = S[-1]
mid = str(len(S)-2)

print(Sstart+mid+Send)

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("{}{}{}".format(s[0],n,s[len(s)-1]))

Solution (Python):
s = list(str(input()))
s = [s[0],len(s)-2,s[-1]]
for i in s:
    print(i,end='')

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 




S = str(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):
def main():
    S = list(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()
first, last = s[0], s[-1]
length = s[1:-1]
print(first+str(len(length))+last)

Solution (Python):
S = input()


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

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

Solution (Python):




def solver(inputStr):
    result = inputStr[0] + str(len(inputStr)-2) + inputStr[-1]
    return result


if __name__ == "__main__":
    result = solver(input())
    print(result)

Solution (Python):
s = input()

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

Solution (Python):
s = input()

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

Solution (Python):

s = list(str(input()))

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

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

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

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

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

Solution (Python):
import sys
bbn=1000000007
	

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

isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

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

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

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

Solution (Python):
import sys

s = sys.stdin.readline().rstrip()
l = len(s)

def main():
    return s[0] + str(l-2) + s[-1]

if __name__ == '__main__':
    ans = main()
    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()
a = int(len(s))
r = a - 2
print(str(s[0])+str(r)+str(s[a-1]))

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

Solution (Python):




def solver(inputStr):
    result = inputStr[0]+str(len(inputStr)-2)+inputStr[-1]
    return result


if __name__ == "__main__":
    result = ''
    result = solver(input())
    print(result)

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

Solution (Python):
s = input()

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

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

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

Solution (Python):
import math

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

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

Solution (Python):
n = input()

print('{}{}{}'.format(n[0],len(n)-2,n[-1]))

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

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

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

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

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

Solution (Python):
def omit_char(args):
  start_char = ""
  last_char = ""
  cnt = 0
  for c in args:
    if cnt == 0:
      start_char = c
    last_char = c
    cnt += 1
  ans = start_char + str(cnt-2) + last_char
  print(ans)


omit_char(input())

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

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

LEN = len(slis[1:len(slis)-1])


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

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

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

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

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

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

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

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

Solution (Python):





s = list(input())

memo = len(s)-2

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

Solution (Python):
s = input()

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

print(ans)

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

first = l.pop(0)
last = l.pop()

count = len(l)

print(first + str(count) + last)

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

Solution (Python):
s = input()

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

print(output)

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

Solution (Python):
a = input()
ans = 0
for i in range(1, len(a)-1):
    ans += 1

print(a[0]+str(ans)+a[len(a)-1])

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

Solution (Python):
s = input()

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

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

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

b = str(len(b))

print(a + b + c)

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

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

Solution (Python):
s = input()

first = s[:1]
last = s[len(s)-1:]
l = len(s[1:len(s)-1])
print(first+str(l)+last)

Solution (Python):
input_str = input()
spl_list = list(input_str)
spl_len = len(spl_list) - 2

print(spl_list[0] + str(spl_len) + spl_list[len(spl_list) - 1])

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

Solution (Python):
s = input()
l = len(s)-2
print(s[0]+str(l)+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):
from sys import stdin
from itertools import groupby

s = stdin.readline().rstrip()

si = ""

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

print(si)

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

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

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

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

Solution (Python):
n = input()

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

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

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

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

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

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

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

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

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

Solution (Python):
def examB():
    St = S()
    ans = St[0] + str(len(St)-2) + St[-1]
    print(ans)

import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Solution (Python):

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

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

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

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

Solution (Python):



s = input()







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

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

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

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

main()

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

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

Solution (Python):
s = input()
l = len(s)
l_b = l-2
s_t = list(s)

print(s_t[0] + str(l_b)+ s_t[l-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):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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], len(s)-2, s[-1], sep="")

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

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

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

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

Solution (Python):
a = input()
num = len(a)-2

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

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

Solution (Python):
from sys import stdin
s = stdin.readline().rstrip()
print(''.join([s[0], str(len(s) - 2), s[-1]]))

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

Solution (Python):

s = str(input())
ans = [s[0],len(s)-2,s[-1]]
print(''.join(map(str, ans)))

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

Solution (Python):
import sys
input = sys.stdin.readline
s = input()[: -1]
print(s[0] + str(len(s) - 2) + s[-1])

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    s = inputs[0]
    count = 0
    for i, c in enumerate(s):
        if i == 0:
            first = c
        elif i == len(s) - 1:
            last = c
        else:
            count += 1
    return '{}{}{}'.format(first, count, last)


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

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

Solution (Python):

def main():
    S = input().rstrip()
    ans = S[0] + str(len(S) - 2) + S[-1]
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()

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

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

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

Solution (Python):
"""
author : halo2halo
date : 25,Oct,2019
"""

import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

N = readline().rstrip()

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

Solution (Python):

s = input()

number = len(s) - 2

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

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

Solution (Python):



import unittest
from io import StringIO
import sys


def input():
    return sys.stdin.readline().rstrip()


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


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """internationalization"""
        output = """i18n"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """smiles"""
        output = """s4s"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """xyz"""
        output = """x1z"""
        self.assertIO(input, output)


if __name__ == "__main__":
    
    resolve()

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

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

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

Solution (Python):
S = input()

num = str(len(S) - 2) 

print(S[0] + num + S[-1])

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

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

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

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

Solution (Python):
s = input()

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

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

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

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

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

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

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

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

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

Solution (Python):
input_line = input()
input_temp = list(input_line)
a = input_temp[0]
b = input_temp[len(input_temp)-1]
n = len(input_temp)-2

print(a+str(n)+b)

Solution (Python):
a,*b,c = input()

print(a + str(len(b)) + c)

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

print(n[0]+num+n[-1])

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

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

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

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

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

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

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

Solution (Python):
s = input()

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

print(a)

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

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

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

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

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

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

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

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

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

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



def main():


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



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

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

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

Solution (Python):
s = input()
l = list(s)
a = len(l)-2
print(l[0],end='')
print(a,end='')
print(l[len(l)-1])

Solution (Python):
S=str(input())
size=len(S)

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

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

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

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

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