import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
r = decimal.Decimal(input())
ans = [decimal.Decimal(100) for i in range(n)]
a = 0
for i in range(n):
    a += ans[i]
    if i != n-1:
        ans[i+1] = (decimal.Decimal(1) - r)*ans[i]
print(a)