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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def read_input():
    s = input().strip()
    return s

def submit():
    s = read_input()
    head = s[0]
    tail = s[-1]
    mid = s[1:-1]

    print(head + str(len(mid)) + tail)


if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

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

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
s_new = []
s_new.append(s[0])
s_new.append(str(len(s)-2))
s_new.append(s[len(s)-1])

print(''.join(s_new))

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    s = input().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[1:-2])+1) + s[-1])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc069/tasks/abc069_b

import itertools
import collections
import bisect

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1,*s2,s3=map(str,input())
print(s1+str(len(s2))+s3)

Submission status: Accepted

Solution code:
import sys
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
saisho = S[0]
del S[0]
saigo = S[-1]
del S[-1]
kazu = str(len(S))
print(saisho+kazu+saigo)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().rstrip()
part = s[1:-1]

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

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    S = list(map(str, input().strip()))
    n = len(S) - 2
    i = S[0]
    e = S[-1]

    ans = str(i) + str(n) + str(e)

    return ans


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

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def i18n(s: str)->str:
    n = len(s)
    return s[0] + str(n-2) + s[-1]


if __name__ == "__main__":
    s = input()
    ans = i18n(s)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

x=s[1:-1]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

n = str(len(s) -2)

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    n, m = LI()
    print((n-1)*(m-1))
    return

#B
def B():
    s = S()
    print(s[0]+str(len(s)-2)+s[-1])
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
"""
n,m = LI()
print((n-1)*(m-1))
"""

#B
s = S()
print(s[0]+str(len(s)-2)+s[-1])
#C
"""
n = I()
a = LI()
d = [0,0]
for i in a:
    if i%2:
        d[0] += 1
    if i%4 == 0:
        d[1] += 1
if n % 2:
    d[0] -= 1
d[0] -= d[1]
if d[0] <= 0:
    print("Yes")
else:
    print("No")
"""

#D
"""
h,w = LI()
n = I()
a = LI()
c = [[None for x in range(w)] for y in range(h)]
i = 0
for y in range(h):
    if y%2:
        for x in range(w)[::-1]:
            if not a[i]:
                i += 1
            c[y][x] = i+1
            a[i] -= 1
    else:
        for x in range(w):
            if not a[i]:
                i += 1
            c[y][x] = i+1
            a[i] -= 1
for i in c:
    print(*i)
"""

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
""" AtCoder """

s = input()

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

Submission status: Accepted

Solution code:
s = list(input())
s0 = s[0]
s1 = s[-1]
s.pop(0)
s.pop(-1)
s2 = str(len(s))

print(s0+s2+s1)

Submission status: Accepted

Solution code:
# coding: utf-8
a, *s, b = input()
print(a + str(len(s)) + b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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

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


#n = ip()                              #入力整数1つ
#h,w= (int(i) for i in input().split())      #入力整数横2つ
#n,x,y = (int(i) for i in input().split())    #入力整数横3つ
#n,a,b,c= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)

#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
l = len(a)
print(a[0],end='')
print(l-2,end='')
print(a[l-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

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

Submission status: Accepted

Solution code:
s = raw_input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon Feb 25 00:20:36 2019

@author: yuta
"""

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 069B
s = input()
print('{}{}{}'.format(s[0], 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:
s=input()
ans=[s[0]]
ans.append(str(len(s)-2))
ans.append(s[len(s)-1])
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str_s = input()

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

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# i18n
import sys

s = input()
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=list(input())
s_0=s.pop(0)
s_n=s.pop(len(s)-1)
print(str(s_0)+str(len(s))+str(s_n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline
S = input()[:-1]  # remove \n
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[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:
line = input()
print('{}{}{}'.format(line[0],len(line)-2,line[-1]))

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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


abc069_b()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = str(input())
T,U = S[0],S[-1]
print(S[0]+str(len(S[1:len(S)-1]))+S[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# _*_ coding:utf-8 _*_
#  Atcoder_Beginners_Contest069-B
#  https://beta.atcoder.jp/contests/abc085/tasks/abc085_a


def change_i18n(s):

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

a=''

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
str_line = input()
str_list = [i for i in str_line]
print(str_list[0], end="")
print(len(str_line)-2, end="")
print(str_list[len(str_line)-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(start + number + end)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
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:
from sys import stdin


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
l=0
ret=0

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

S= [i for i in s]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(result)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

ans = []

ans.append(s[0])

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

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

print(''.join(ans))

Submission status: Accepted

Solution code:
s = input()

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