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:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#N, K = map(int, input().split())
#L = list(map(int, input().split()))
#N = int(input())
S = str(input())

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Problem https://atcoder.jp/contests/abc069/tasks/abc069_b
# Python 2nd Try


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


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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = list(str(input()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
bbn=1000000007
	
#+++++
		
def main():
	s = input()
	ret=s[0]+str(len(s)-2)+s[-1]
	print(ret)
	
	
#+++++
isTest=False

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

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

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ == '__main__':
    ans = main()
    print(ans)

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

Submission status: Accepted

Solution code:
# Problem
# Python 1st Try


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


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

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your 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[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();l=s[1:-1]
print(s[0]+str(len(l))+s[-1])

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


omit_char(input())

Submission status: Accepted

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

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))


s = list(input())

memo = len(s)-2

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

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

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

count = len(l)

print(first + str(count) + last)

Submission status: Accepted

Solution code:
s = input()

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

print(output)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
s = 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()
s=str(s)
n=len(s)-2
n=str(n)
print (s[0]+n+s[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 = str(input())

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

b = str(len(b))

print(a + b + c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
##### 解けた #####

s=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
from itertools import groupby

s = stdin.readline().rstrip()

si = ""

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

print(si)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

examB()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s=list(input())
l=str(len(s)-2)
print(s[0]+l+s[len(s)-1])

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

# print(s)

# for i in range(len(s)):
#     # print(s[i])
#     pass

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(s_t[0] + str(l_b)+ s_t[l-1])

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#069b
s = str(input())
ans = [s[0],len(s)-2,s[-1]]
print(''.join(map(str, ans)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


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


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


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


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


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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 25,Oct,2019
"""

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

N = readline().rstrip()

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

Submission status: Accepted

Solution code:

s = input()

number = len(s) - 2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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


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

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

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

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

num = str(len(S) - 2) 

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

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:
input_line = input()
input_temp = list(input_line)
a = input_temp[0]
b = input_temp[len(input_temp)-1]
n = len(input_temp)-2

print(a+str(n)+b)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(s[0] + str(l) + s[l + 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:
def main():
    s=input()
    print(str(s[0])+str(len(s)-2)+str(s[-1]))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(a)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    s = str(input().rstrip('\n'))
    print(s[0] + str(len(s)-2) + s[-1])


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

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

li=[]

li.append(s[0])
li.append(str(len-2))
li.append(s[len-1])

ss="".join(li)
print(ss)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2019/09/25
s = input()
print(s[0] + str((len(s)-2)) + s[len(s)-1])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

s = list(input().strip())

c = len(s)

a, b = s[0], s[c-1]

d = [ a , c - 2 , b]

d = map(str,d)

d = ''.join(d)

print(d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()

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

Submission status: Accepted

Solution code:
s = input()
cnt = 0
for i in s:
    cnt += 1

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

Solution code:
s = input()

A = s[0]
B = s[-1]
C = len(s)-2
print(A+str(C)+B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
s=input()
l=len(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
s = input()
ans = s[0]
ans += str(len(s[1:-1])) + s[-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()

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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC069b
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

s = input()[:-1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = len(S)

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

print(a+str(N-2)+b)

Submission status: Accepted

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

Submission status: Accepted

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

text = input()

middle_char_count = len(text) - 2

print("{}{}{}".format(text[0], str(middle_char_count), text[-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()
l = len(s)
b = l - 2

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

print(s1 + str(b) + s2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

def main():

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    resolve()