#!/bin/python3

import sys

def solve(d):
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.
    a=''
    for i in range(2):
        for i in d:
            a=a+str(i)
        b=a

        for k in range(0,len(a)-1):
            for i in range(0,len(a)-k-1):
                j=i+k
                b=b+b[j]


    c=[int(i) for i in b]
    return(sum(c)+(sum(d)*2)+int(d[1]))

if __name__ == "__main__":
    n = int(input().strip())
    d = list(map(int, input().strip().split(' ')))
    result = solve(d)
    print(result)