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



Sample input:
internationalization


Sample output:
i18n

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

if __name__ == '__main__':
    s = input()
    main(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

length = len(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,*b,c= input()
print(a,len(b),c,sep="")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = input()
ln = len(l)-2

print(l[0],ln,l[len(l)-1],sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

length = len(s)

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

Submission status: Accepted

Solution code:
a, *b, c = input()
print("{}{}{}".format(a, len(b), c))

Submission status: Accepted

Solution code:
# input
s = input()

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

# output
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
import bisect
 
stdin = sys.stdin
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
text = input()
first_str = text[0]
last_str = text[-1]
num = len(text) - 2
print(first_str + str(num) + last_str)

Submission status: Accepted

Solution code:
a = input()
l = len(a)-2

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

Submission status: Accepted

Solution code:
s = input()
s_f = s[0]
s_l = s[-1]

leng = str(len(s)-2)
name = s_f + leng + s_l
print(name)

Submission status: Accepted

Solution code:
N=input()
Ini=N[0]
End=N[len(N)-1]
Med=len(N)-2

LIST=[Ini,str(Med),End]
print("".join(LIST))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

ans = [a,b,c]
res = "".join(ans)
print(res)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
l = [s[0], str(len(s)-2), s[-1]]
print(''.join(l))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
start = s[0]
mid = int(len(s)-2)
end = s[int(len(s))-1]
print('{}{}{}'.format(start, mid, end))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, *b, c = input()
print(a, str(len(b)), c, sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#069B
s = input()
print(s[0]+str(len(s)-2)+s[len(s)-1])

Submission status: Accepted

Solution code:
s=list(input())

s1=s[0]
s2=s[-1]

print("{0}{1}{2}".format(s1,len(s)-2,s2))

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
list=[s for s in input()]
med=len(list)
med2=med-2
print(list[0]+str(med2)+list[med-1])

Submission status: Accepted

Solution code:
s=input()
num=len(s)-2
print(s[0], num, s[num+1], sep="")

Submission status: Accepted

Solution code:
s = input()

s_len = len(s)

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

print(result)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
a,*b,c = input()
print(a,len(b),c, sep='')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    s = next(tokens)  # type: str
    solve(s)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
a = input()
n1 = a[0]
b = len(a) - 2
n2 = a[-1]
print('{}{}{}'.format(n1,b,n2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

top = s[0]
last = s[-1]
length = len(s[0:]) - 2

print(top + str(length) + last)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input().rstrip("\n")
print(string[0] + str(len(string) - 2) + string[-1])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# input
s = input()

# solve & output
print(s[0] + str(len(s) - 2) + s[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

num = input()

char = list(num)

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

Submission status: Accepted

Solution code:
a, *b, c = input()
print(a, len(b), c, sep="")

Submission status: Accepted

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

Submission status: Accepted

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

print(new_text)

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
x = input()

n=[]
for i in x:
  n.append(i)
p=str(len(n)-2)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(str(input()))
first = s.pop(0)
last = s.pop(-1)
mid = len(s)
print("{0}{1}{2}".format(first, mid, last))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

s_num = len(s)

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
 #ABC 69, B - i18n
s = input()
print(s[0] + str(len(s)-2) + s[len(s)-1])

Submission status: Accepted

Solution code:
str_list = list(input())

length = len(str_list)

str_shorten = str_list[0] + str(length - 2) + str_list[length - 1]

print(str_shorten)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()

nLen = len(S)

nLen -= 2

a = S[0]
b = S[-1]

print('%s' %(a) + '%d' %(nLen) + '%s' %(b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    s = next(tokens)  # type: str
    solve(s)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    s = input()
    
    ans = s[0]
    end = s[-1]
    cnt = len(s) - 2
    
    print(ans + str(cnt) + end)
    
    
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
L = len(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
lis = [s[:1],str(len(s)-2),s[-1]]
print("".join(lis))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

s = input()

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

Submission status: Accepted

Solution code:
S = input()
N = len(S)-2

S = S[0] + str(N) + S[-1]
print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input() # sを取得し、strに値を入れる
# s = "interaction"
s1 = s[0]
s2 = s[-1]
print(str(s1)+str(int(len(s)-2))+str(s2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC69 B

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

Submission status: Accepted

Solution code:
s = list(input())
count = 0
for i in range(1,len(s)-1):
  count += 1
print(str(s[0])+str(count)+str(s[len(s)-1]))

Submission status: Accepted

Solution code:
# ABC069-B
s = input()
ss = s[1:len(s)-1]
print('{}{}{}'.format(s[0], len(ss), s[len(s)-1]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
#print(len(s))
r0=len(s)-1
r=len(s)-2
rs=str(r)
print(s[0] + rs + s[r0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(y)

Submission status: Accepted

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

print('%s%d%s' % (s[0], l-2, s[-1]))

Submission status: Accepted

Solution code:
a = list(str(input()))
a[1:len(a)-1] = [str(len(a)-2)]
print("".join(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
row = input().split()
s = list(row[0])
num = len(s) - 2
ans = []
ans.append(s[0])
ans.append(num)
ans.append(s[len(s)-1])
ans = list(map(str, ans))
print("".join(ans))

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

s = list(input())
head, tail = s[0], s[-1]
print(head + str(len(s) - 2) + tail)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
sin=str(input())
sout=sin[0]+str(len(sin)-2)+sin[len(sin)-1]
print(sout)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# !/usr/bin python3
# -*- coding: UTF-8 -*-

s = input()

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

Submission status: Accepted

Solution code:
s = input()
head_s = s[0]
n = len(s[1:-1])
tail_s = s[-1]
print("%s%d%s" % (head_s, n, tail_s))

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

S = s()

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

Submission status: Accepted

Solution code:
s=input()

sta=s[0]
end=s[-1]

mid=str(len(s)-2)

print(sta+mid+end)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = input()
word_len = len(word)
word_s = word[0]
word_e = word[-1]
word_bet = str(word_len - 2)
print(word_s + word_bet + word_e)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
# from pprint import pprint


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

length = len(s)


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

Submission status: Accepted

Solution code:
s = str(input())
l = len(s) - 2

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

Submission status: Accepted

Solution code:
#一文字ずつ区切る
chars = list(input())
#文字列で入っているぽい[internationalization]
#len(chars)で文字の長さを数える
#最初の文字と真ん中の数と最後の文字を出力させる
#strでInt型をStringに変換する
print(chars[0]+str(len(chars)-2)+chars[len(chars)-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

S = sys.stdin.readline().rstrip()
print(S[0] + str(len(S) - 2) + S[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

s_len = len(s)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    s = next(tokens)  # type: str
    solve(s)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
cnt = 0
S = list(S)
S_t = S[0]
S.pop(0)
S_b = S[-1]
S.pop(-1)
for i in range(len(S)):
    cnt += 1

print(S_t + str(cnt) + S_b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
F, *M, L = list(input())
print(F + str(len(M)) + L)

Submission status: Accepted

Solution code:
s = list(input())

l = len(s)-2

ls = [s[0],str(l),s[-1]]

print("".join(ls))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()     #internationalization

s_mid_len = len(s) - 2

T = s[0] + str(s_mid_len) + s[-1]
print(T)

Submission status: Accepted

Solution code:
s,*d,f=input()
print(s+str(len(d))+f)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    s = str(input())

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

Submission status: Accepted

Solution code:
from sys import stdin
s = stdin.readline().rstrip()
print(s[0]+str(len(s[1:-1]))+s[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
f = s[0]
e = s[-1]
s.pop(0)
s.pop(-1)
l = len(s)
print("".join([f, str(l), e]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
top = str(s[0:1])
middle = str(len(s)-2)
tail = str(s[len(s)-1:len(s)])
print(top + middle + tail)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
letter = input("")

length = len(letter) - 2

ans = letter[0] + str(length) + letter[-1]
print(ans)

Submission status: Accepted

Solution code:
s = input()
s_list = []

for i in s:
    s_list.append(i)

count = len(s_list)-2

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

Submission status: Accepted

Solution code:
s = input()
first = s[0]
last = s[-1]
len_s = len(s) - 2
new_s = first + str(len_s) + last

print(new_s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
word = s
A = len(s)
B = A - 2
C = word[0]
D = word[-1]
str_B = str(B)
E = C + str_B + D
print(E)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

count = len(s) -2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

m=str(len(s)-2)

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
First=s.pop(0)
Last=s.pop(len(s)-1)
print(First+str(len(s))+Last)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
List = [i for i in input()]

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

Submission status: Accepted

Solution code:
# 入力
s=input()

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

Submission status: Accepted

Solution code:
S = input()

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

print(res)

Submission status: Accepted

Solution code:
s=list(input())
f,l=s.pop(0),s.pop()
print(f+str(len(s))+l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
slen = len(s)
l = slen-2

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc069/tasks/abc069_b
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
trans = [s[i:i+1] for i in range(len(s))]
a = len(s) - 2
print(trans[0] + str(a) + trans[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
s_top = s[0]
s_bottom = s[-1]
num = len(s) - 2
print(s_top + str(num) + s_bottom)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# s = input()
#
# s = s.replace(s[1:len(s)-1], str(len(s)-2), 1)
# print(s)

s = input()

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