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

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

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

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

Solution (Python):
s = input()
print('%s%d%s' % (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):
S = [i for i in input()]
print(S[0]+str(len(S)-2)+S[-1])

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
s = input()

sFirst = s[0]
sLast = s[len(s)-1]

print(sFirst +str(len(s)-2)+sLast)

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

Solution (Python):
s = input().rstrip()

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

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

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

Solution (Python):
""" AtCoder """

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())
s0 = s[0]
s1 = s[-1]
s.pop(0)
s.pop(-1)
s2 = str(len(s))

print(s0+s2+s1)

Solution (Python):

a, *s, b = input()
print(a + str(len(s)) + b)

Solution (Python):
import re
s=input()
c=s[1:-1]
l=len(re.match('[a-zA-Z]*', c).group(0))
print(s[0]+str(l)+s[-1])

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

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

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

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

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

Solution (Python):
a,*s,z=input()
print('{}{}{}'.format(a, len(s), z))

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

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

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

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

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

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

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy

def j(q):
    if q==1: print("Heisei")
    else:print("TBD")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())







a = input()                                  






l = len(a)
print(a[0],end='')
print(l-2,end='')
print(a[l-1])

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

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

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

init, end = s[0], s[len(s)-1]

print(init + str(len(s)-2) + end)

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,*t,r=input();print(s+'%d'%len(t)+r)

Solution (Python):
s,*t,r=input();print(s+'%d'%len(t)+r)

Solution (Python):

"""
Created on Mon Feb 25 00:20:36 2019

@author: yuta
"""

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

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

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

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

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

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

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

Solution (Python):
s = input()

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

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


f=(s[0])
l=(s[-1])
length=len(s[1:-1])


print("{}{}{}".format(f,length,l))

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

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

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

s_ary = list(s)
print(s_ary[0] + str(s_length - 2) + s_ary[s_length - 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[1:-1])) + 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 = list(input())
n = len(S) - 2
h = S[0]
o = S[-1]
ans = h + str(n) + o
print(ans)

Solution (Python):
s = str(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('{}{}{}'.format(s[0], 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[-1])

Solution (Python):
str_s = input()

print(str_s[0] + str(len(str_s[1:-1])) + str_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[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()

start = s[0]
end = s[len(s) - 1]
num = len(s) - 2

ans = start + str(num) + end
print(ans)

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):


a = input()

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

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

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

Solution (Python):

import sys

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

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

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

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

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

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

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

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

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

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

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

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

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


abc069_b()

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

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

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
S = input()

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

print(a, end="")
print(c, end="")
print(b)

Solution (Python):
s = input()

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

Solution (Python):





def change_i18n(s):

	length = len(s)
	umekomiINT = length-2
	umekomiSTR = str(umekomiINT)
	answerStr = s[0:1] + umekomiSTR + s[length-1:length]
	return answerStr


if __name__ == '__main__':
	problemStr=input()
	answerStr=change_i18n(problemStr)
	print(answerStr)

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

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

a=''

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

print(a)

Solution (Python):

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

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

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

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

Solution (Python):


if __name__ == "__main__":
    s = str(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):
str_line = input()
str_list = [i for i in str_line]
print(str_list[0], end="")
print(len(str_line)-2, end="")
print(str_list[len(str_line)-1])

Solution (Python):
s = input()
t = ""
count = 0
for i in range(len(s)):
  if i == 0:
    t += s[i]
  elif i == len(s) - 1:
    t += s[i]
  else:
    count += 1
    if i == len(s) - 2:
      t += str(count)
print(t)

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

ans = f + str(len(s) - 2)+ l

print(ans)

Solution (Python):
S = input()
l = S.__len__()
print('%s%s%s' % (S[0], l-2, S[l-1]))

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

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

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

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

Solution (Python):
a = list(input())
b = str(len(a)-2)

print(a[0] + b + a[-1])

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

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

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

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

Solution (Python):
s = input()
start = s[0:1]
end = s[len(s)-1:len(s)]
contents = s[1:len(s)-1]
number = str(len(contents))

print(start + number + end)

Solution (Python):
s = input()
S = list(s)
str1=S[0]
str2=S[-1]
n=len(S)
str3=S[1:n-1]
x=len(str3)
X=str(x)
print(str1+X+str2)

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

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

Solution (Python):


s = input()

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

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

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

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

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):
from sys import stdin


def main() -> None:
    s = next_str()
    print(s[0], len(s) - 2, s[-1], sep="")


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Solution (Python):
s=input()

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

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

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

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

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

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

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

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

Solution (Python):
l=0
ret=0

s=input()
l += len(s)-1
ret = l - 1

S= [i for i in s]

print(S[0]+str(ret)+S[l])

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

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

Solution (Python):
s = input()

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

print(result)

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

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

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

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

ans.append(s[len(s) - 1])

print(''.join(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()

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

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

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

s = lc()

print("".join([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()
n = len(s)-2
num = "{}".format(n)
print(s[0] + num + s[-1])

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

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

Solution (Python):
s = input()
res =''
counter = 0
for i in range(len(s)):
    if i == 0:
        res = res + s[i]
    elif i == len(s)-1:
        res = res + str(counter) + s[i]
    else:
        counter += 1
print(res)

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):
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()
n = len(s)-2
N = str(n)
print(s[0]+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):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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

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

Solution (Python):
S = input()
length = len(S)

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

Solution (Python):
S = raw_input()
length = len(S)

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

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

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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return




dp = None


def main():
    S = input()

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


main()

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

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

Solution (Python):

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

Solution (Python):



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


if __name__ == "__main__":
    main()

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


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

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

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

solve()

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

Solution (Python):
s = input()

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

print(res)

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

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

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

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

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

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

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('{}{}{}'.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[-1])

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

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

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

ans=[S[0],str(len(S)-2), S[len(S)-1]]

print(''.join(ans))

Solution (Python):
word = input()

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

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

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

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


s = input()

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

Solution (Python):

s = input()

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

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

Solution (Python):
s = input()

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

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

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

Solution (Python):

test = raw_input()

head = test[0]
tail = test[-1]
middle_len = str(len(test[1:-1]))

result = head +  middle_len + tail 

print(result)

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

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

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

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

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

Solution (Python):
input_str = input('')
start = input_str[:1]
end = input_str[-1:]
print(start + str((len(input_str) - 2)) + end)

Solution (Python):
s = input()

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