A = int(input())
P = list(map(int,input().split()))
P = [p / 100 for p in P]
N = 80 - A
#dp = [[0] * (1 << 14) for _ in range(N+1)]
#dp[0][-1] = 1
"""
dp = [0] * (1 << 14)
dp[-1] = 1
for j in range(N):
    nx = [0] * (1 << 14)
    for bit in range(1 << 14):
        T = bit
        while True:
            tmp = 1
            for i in range(14):
                mask = 1 << i
                if bit & mask == 0:
                    continue
                count = 0
                if bit & (mask >> 1):
                    count += 1
                if bit & (mask << 1):
                    count += 1
                if T & mask:
                    tmp *= 1 - P[count]
                else:
                    tmp *= P[count]
            nx[T] += dp[bit] * tmp
            if T == 0:break
            T -= 1
            T &= bit
    dp = nx
"""
n = 1 << 14
from collections import defaultdict
l = defaultdict(lambda :defaultdict(int))
for bit in range(n):
    T = bit
    while True:
        tmp = 1
        for i in range(14):
            mask = 1 << i
            if bit & mask == 0:
                continue
            count = 0
            if bit & (mask >> 1):
                count += 1
            if bit & (mask << 1):
                count += 1
            if T & mask:
                tmp *= 1 - P[count]
            else:
                tmp *= P[count]
        l[T][bit] += tmp
        if T == 0:break
        T -= 1
        T &= bit
dp = [0] * n
dp[-1] = 1
for _ in range(N):
    nx = [0] * n
    for bit in range(n):
        T = bit
        while True:
            nx[T] += dp[bit] * l[T][bit]
            if T == 0:break
            T -= 1
            T &= bit
    dp = nx
"""
def seki(x,y):
    l = [[0] * n for _ in range(n)]
    for i in range(n):
        for j in range(n):
            for k in range(n):
                l[i][j] += x[i][k] * y[k][j]
    return l
"""


ans = 0
for bit in range(n):
    num = bin(bit).count("1")
    ans +=num * dp[bit]
print(ans * 2)