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-*-
#strs = []
#n,k = map(int,input().split())
#hates = list(input().split())

inputstr = input()
length = len(inputstr) - 2
print('{}{}{}'.format(inputstr[0],length,inputstr[-1]))

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

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

print(ans)

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""

# Written by NoKnowledgeGG @YlePhan

#import math
#mod = 10**9+7



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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

s = input()

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

Submission status: Accepted

Solution code:

import math
import itertools
import statistics
#import numpy as np
import collections

#n = int(input())
#a, b, c, d = list(map(int, input().split()))
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

resolve()

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

s = STR()
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:
from sys import stdin
def main():
    readline=stdin.readline
    S=readline().strip()
    print(S[0]+str(len(S)-2)+S[-1])
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(input())

M = []

M.append(N[0])
M.append(str(len(N) - 2))
M.append(N[-1])

date = ''.join(M)
print(date)

Submission status: Accepted

Solution code:
s=input()

ans=[]

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

print(*ans,sep="")

Submission status: Accepted

Solution code:

n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

a=input()
print(a[0]+str(len(a)-2)+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:
#ABC069.B
s = input()
print(s[0]+str(len(s)-2)+s[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
count=0
for i in range(len(s)):
    if i == 0 or i == len(s)-1:
        continue
    else:  
        count=count+1
r=s[0] + "" + str(count) + "" + s[len(s)-1]

print(r)

Submission status: Accepted

Solution code:
# import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq # priolity-queue
# import time
# import itertools
# import collections # queue
# from operator import itemgetter
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def main():
    s = input()
    l = len(s) - 2
    ans = [s[0],str(l),s[-1]]
    print(''.join(ans))
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,*y,z=input()
print(x+str(len(y))+z)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
string = input()
string_length = len(string)
print(string[0] + "%d" % (string_length - 2) + string[string_length - 1])

Submission status: Accepted

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

ans = []

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

print(''.join(map(str,ans)))

Submission status: Accepted

Solution code:
s = list(input())

num = len(s[1:len(s)-2]) + 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s=input()

ini=s[0]
fin=s[-1]
len=str(len(s)-2)

print (ini+len+fin)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().rstrip("\r\n")
ans = s[0]+str(len(s)-2)+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:
#!/usr/bin/env python3
import sys


def solve(s: str):
    print("%s%d%s" % (s[0], len(s) - 2, s[-1]))


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

f = S[0]
e = S[-1]
length = str(len(S)-2)

print(f+length+e)

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

Submission status: Accepted

Solution code:
import sys

word = input()

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())

s = len(a)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

    s=str(input())

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
print(S[0]+str(len(S[0:-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()
moji=[a for a in s]
saisho=moji[0]
saigo=moji[-1]
del moji[0]
del moji[-1]
number=len(moji)
print(saisho+str(number)+saigo)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().strip()
print("{}{}{}".format(s[0], len(s) - 2, s[-1]))

Submission status: Accepted

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


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    ans=[s[0],str(len(s)-2),s[-1]]
    print(''.join(map(str, ans)))

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
l = s.pop(0)
r = s.pop()
print(l, len(s), r, sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


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

    a, *b, c = sys.stdin.readline().rstrip()
    print(a, len(b), c, sep="")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#ABC069

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# %% A
h,*b,t = input()
print(h+str(len(b))+t)

Submission status: Accepted

Solution code:
text = input()

top = text[0]
bottom = text[-1]
result = top + str(len(text) - 2) + bottom
print(result)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = str(input())

num = len(s) -2
f_char = s[0]
l_char = s[-1]

ans = str(f_char) + str(num) +str(l_char)

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

a,*b,c = s

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

    count = (len(s) - 2)

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

def main():
    s = str(input())
    print(i18n(s))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

main()

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

Submission status: Accepted

Solution code:
s = input()

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

print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# input examples : internationalization
# output examples : i18n
words = input()
print("{}{}{}".format(words[0],str(len(words[1:-1])),words[-1]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = str(input())

x = len(s) -2

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

Submission status: Accepted

Solution code:
s = str(input())

x = len(s) -2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

l = len(s) - 2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=str(input())  #数値入力 「N」だけの入力のとき
a=n[1:-1]
print(n[0] + str(len(a)) + n[-1])

Submission status: Accepted

Solution code:
import math
import calendar
import fractions
import itertools

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = readline().decode('utf8').rstrip()
ans=S[0]+str(len(S[1:len(S)-1]))+S[-1]

print(ans)

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().rstrip()
l = len(s[1:len(s)-1])
print(s[0]+str(l)+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%d%s' % (s[0], len(s) - 2, s[-1]))

Submission status: Accepted

Solution code:
import math

def intinput():
    return int(input())

def listintinput():
    return list(map(int,input().split()))

def splitintinput():
    return map(int,input().split())

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:
#!/usr/bin/env python3
s = input()
print(s[0]+str(len(s)-2)+ s[-1])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=STR()
    print(s[0]+str(len(s)-2)+s[-1])
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

l = len(a)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 文字列の入力
s = input()
# 変換
ans = s[0] + str(len(s) - 2) + s[-1]
# 出力
print(ans)

Submission status: Accepted

Solution code:
s = input()

counter = 0
for i in s:
    counter += 1

counter = counter - 2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

S = input()
Ss = S[0]
Sc = len(S)-2
Se = S[-1]
print(Ss+str(Sc)+Se)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
#print(s[0],s[1:-1],s[-1])
print(s[0]+str(len(s[1:-1]))+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:
li = list(input())
l = len(li)
count = 0
for i in range(1,l-1) :
    count+=1
C = str(count)
print(li[0] + C + li[-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())
num = len(a)
print(a[0]+str(num-2)+a[-1])

Submission status: Accepted

Solution code:
s = input()

#間の文字数 = 文字数 - 2
n = len(s) - 2
s1 = s[0] + str(n) + s[-1]

print(s1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 069 - B
# -*- encoding: UTF-8 -*-

s = input()
slist = list(s)

leng = len(slist) - 2

sf = slist[0]
se = slist[-1]

result = sf + str(leng) + se

print(result)

Submission status: Accepted

Solution code:


import numpy as np

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

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()
n=len(s)
t=s[0]+str(n-2)+s[n-1]
print(''.join(map(str,t)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input().rstrip()
start = s[0]
last = s[-1]
middle = str(len(s) - 2)
print(start + middle + last)

Submission status: Accepted

Solution code:
s = input()

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

print(new_s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

    main(s)

Submission status: Accepted

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

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

Submission status: Accepted

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


def solver(inputStr) :
    top =  inputStr[0]
    middle = len(inputStr)-2
    endChar = inputStr[-1]
    return top,middle,endChar


if __name__=="__main__" :
    answer1=''
    answer2=0
    answer3=''
    S = input()
    answer1,answer2,answer3= solver(S)
    print(answer1,answer2,answer3,sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

num = len(s)

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

Submission status: Accepted

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

print(''.join(lst))

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

Sstart = S[0]
Send = S[-1]
mid = str(len(S)-2)

print(Sstart+mid+Send)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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