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

Submission status: Accepted

Solution code:
#B.py

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

print(s)

Submission status: Accepted

Solution code:
S=str(input())
start=S[0]
end=S[len(S)-1]
num=len(S)-2
print("{}{}{}".format(start,num,end))

Submission status: Accepted

Solution code:
#n = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
s=input()
k=len(s)-2
print("{0}{1}{2}".format(s[0],str(k),s[-1]))

Submission status: Accepted

Solution code:
#
# abc069 b
#

import sys
from io import StringIO
import unittest


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)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    s = s_input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print(f'{s[0]}{len(s) - 2}{s[-1]}')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
#
# abc069 b
#
import sys
from io import StringIO
import unittest


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)


def resolve():
    s = input()
    print(f"{s[0]}{len(s)-2}{s[-1]}")


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
#
# abc069 b
#
import sys
from io import StringIO
import unittest


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)


def resolve():
    s = input()
    print(f"{s[0:1]}{len(s)-2}{s[-1:]}")


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
s=input()

L=len(s)
L_a=L-2

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

Submission status: Accepted

Solution code:
s = input()

a = len(s)
b = len(s)-2

x = s[0] + str(b) + s[len(s)-1]

print(x)

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())
first = s[0]
end = s[-1]

strCount = len(s)-2

print('{}{}{}'.format(first, strCount, end))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	s = input()

	l = len(s[1 : -1])

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

  
if __name__ == "__main__":
  	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

s = input()

num = str(len(s)-2)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
print(s[0] + str(len(s)-2) + s[-1])

Submission status: Accepted

Solution code:

s = input()

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

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

Submission status: Accepted

Solution code:
s=list(input())

L=[s[0]]
L.append(str(len(s)-2))
L.append(s[-1])
print(''.join(L))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
l=str(len(s)-2)
print(s[0]+l+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:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

def main():
    S = input()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    s = readline().strip()

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
string = input()
print(string[0] + str(len(string)-2) + string[-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()
l=len(s)-2
print(str(s[0]),l,str(s[-1]),sep='')

Submission status: Accepted

Solution code:
S = input()
#-------------
S = list(S)
n = len(S)
print(S[0] + str(n-2) + S[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)
res = S[0]+n+S[len(S)-1]
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
count = 0
for x in range(1,len(s)-1,1):
  count +=1

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

Submission status: Accepted

Solution code:
s = input()
print(f"{s[0]}{len(s[1:-1])}{s[-1]}")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

    return f'{head}{length}{tail}'

s = input()
print(actual(s))

Submission status: Accepted

Solution code:
p = input()
s = list(p)

number = len(s) - 2
front = s[0]
rear = s.pop()

print(front, end='')
print(number, end='')
print(rear)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

mojisu = len(lit) - 2

ans = lit[0] + str(mojisu) + lit[-1]

print(ans)

Submission status: Accepted

Solution code:
import sys
def LS2(): 
    return list(sys.stdin.readline().rstrip())  #空白なし

s = LS2()

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

s = LS2()

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

Submission status: Accepted

Solution code:
s = input()

print(s[0]+'%d' % len(s[1:-1])+s[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st_list = list(input())


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

Submission status: Accepted

Solution code:
# coding: utf-8

input_ = input()

ss = input_[0]
sc = input_[1:-1]
se = input_[-1]

print(ss + str(len(sc)) + se)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = str(input())

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

num=len(s)-2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = input()
if len(s) < 3 or len(s) > 100:
    sys.exit()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import sys 

line = sys.stdin.read()
line = line.strip()
start = line[0]
end = line[-1]
print('%s%d%s'%(start, len(line) - 2, end))

Submission status: Accepted

Solution code:
inpuStr = input()
print(f'{inpuStr[0]}{len(inpuStr[0:-2])}{inpuStr[-1]}')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
s = input()

ls= list(s)

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
h = s[0]
t = s[-1]
n = str(len(s[1:-1]))

print(h+n+t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

print(reducestr(s))

Submission status: Accepted

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

Submission status: Accepted

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

m = list(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(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[1:-1])) + S[-1])

Submission status: Accepted

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

Submission status: Accepted

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