# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

def calc2(n, x, q, r):
    def calc3(d):
        # d 日目までもみ消す
        g = d * (q - (1 / x) * r)
        f = (x-1) / x
        if f == 0:
            g += q
        else:
            g += q * (1 - pow(f, n - d)) / (1 - f)
        # print(n, x, q, r, d)
        return g
    
    low = 0
    hi = n
    while abs(hi - low) > 50:
        r1 = (2 * low + hi) // 3
        r2 = (low + 2 * hi) // 3
        g1 = calc3(r1)
        g2 = calc3(r2)
        if g1 > g2:
            hi = r2
        else:
            low = r1
    
    ans = 0
    for i in range(low, hi + 1):
        ans = max(calc3(i), ans)
    return ans

def solve():
    n = II()
    x, y = MI()
    p, q, r = MI()
    
    def calc(d):
        # d 回の研修
        nx = x + d * y
        get = p * d
        
        get += calc2(n-d, nx, q, r)
        return get
    
    low = 0
    hi = n
    while abs(hi - low) > 50:
        r1 = (2 * low + hi) // 3
        r2 = (low + 2 * hi) // 3
        g1 = calc(r1)
        g2 = calc(r2)
        if g1 > g2:
            hi = r2
        else:
            low = r1
    
    ans = 0
    for i in range(low, hi + 1):
        ans = max(calc(i), ans)
    print(ans)
    

t = II()
for i in range(t):
    solve()