@file:Suppress("NOTHING_TO_INLINE", "EXPERIMENTAL_FEATURE_WARNING", "OVERRIDE_BY_INLINE")

import java.io.PrintWriter
import java.math.BigInteger
import java.util.PriorityQueue
import kotlin.math.*
import kotlin.random.Random
import kotlin.collections.sort as _sort
import kotlin.collections.sortDescending as _sortDescending
import kotlin.io.println as iprintln

/** @author Spheniscine */
fun main() { _writer.solve(); _writer.flush() }
fun PrintWriter.solve() {
    val numCases = readInt()
    for(case in 1..numCases) {
        //print("Case #$case: ")
        object {
            val n = readLong()
            val a = Array(3) { read().toBigInteger() }
            val d = read().toBigInteger()

            inline fun forEachNeighbor(v: Long, yield: (u: Long, w: BigInteger) -> Unit) {
                for(i in F.indices) {
                    val f = F[i]
                    if(v % f == 0L) yield(v/f, a[i])
                    (v/f*f).let { yield(it, (v-it) * d) }
                    (v.divCeil(f)*f).let { yield(it, (it - v) * d) }
                }

                yield(0, v * d)
            }

            val ans = run {
                val closed = HashMap<Long, BigInteger>()
                closed[n] = BigInteger.ZERO
                val open = PriorityQueue<Dijk>(11, compareBy { it.c })
                open.add(Dijk(n, BigInteger.ZERO))

                while (true) {
                    val (v, cost) = open.poll() ?: break
                    if (v == 0L)
                        return@run cost
                    if (closed[v].let { it != null && it < cost }) continue
                    forEachNeighbor(v) { u, w ->
                        val ncost = cost + w
                        if (closed.setMin(u, ncost)) {
                            closed[u] = ncost
                            open.add(Dijk(u, ncost))
                        }
                    }
                }

                error("impossible")
            }.also(::println)
        }
    }
}

val F = intArrayOf(2, 3, 5)

data class Dijk(val v: Long, val c: BigInteger)
operator fun Long.times(b: BigInteger) = toBigInteger() * b

infix fun Long.divCeil(other: Long) =
    (this / other).let { if(xor(other) >= 0 && it * other != this) it+1 else it }
infix fun Long.divCeil(other: Int) = divCeil(other.toLong())

fun <K> MutableMap<K, Long>.setMax(k: K, v: Long) =
    if(get(k).let { it == null || v > it }) { put(k, v); true } else false
fun <K> MutableMap<K, Long>.setMin(k: K, v: Long) =
    if(get(k).let { it == null || v < it }) { put(k, v); true } else false

fun <K, V: Comparable<V>> MutableMap<K, V>.setMax(k: K, v: V) =
    if(get(k).let { it == null || v > it }) { put(k, v); true } else false
fun <K, V: Comparable<V>> MutableMap<K, V>.setMin(k: K, v: V) =
    if(get(k).let { it == null || v < it }) { put(k, v); true } else false

/** IO */
//@JvmField val INPUT = File("input.txt").inputStream()
//@JvmField val OUTPUT = File("output.txt").outputStream()
@JvmField val INPUT = System.`in`
@JvmField val OUTPUT = System.out

const val _BUFFER_SIZE = 1 shl 16
@JvmField val _buffer = ByteArray(_BUFFER_SIZE)
@JvmField var _bufferPt = 0
@JvmField var _bytesRead = 0

tailrec fun readChar(): Char {
    if(_bufferPt == _bytesRead) {
        _bufferPt = 0
        _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)
    }
    return if(_bytesRead < 0) Char.MIN_VALUE
    else {
        val c = _buffer[_bufferPt++].toChar()
        if (c == '\r') readChar()
        else c
    }
}

fun readLine(): String? {
    var c = readChar()
    return if(c == Char.MIN_VALUE) null
    else buildString {
        while(true) {
            when(c) {
                '\n', Char.MIN_VALUE -> return@buildString
                else -> {
                    append(c)
                    c = readChar()
                }
            }
        }
    }
}
fun readLn() = readLine()!!

fun read() = buildString {
    var c = readChar()
    while(c <= ' ') {
        if(c == Char.MIN_VALUE) return@buildString
        c = readChar()
    }
    do {
        append(c)
        c = readChar()
    } while(c > ' ')
}
fun readInt() = read().toInt()
fun readDouble() = read().toDouble()
fun readLong() = read().toLong()
fun readStrings(n: Int) = List(n) { read() }
fun readLines(n: Int) = List(n) { readLn() }
fun readInts(n: Int) = List(n) { read().toInt() }
fun readIntArray(n: Int) = IntArray(n) { read().toInt() }
fun readDoubles(n: Int) = List(n) { read().toDouble() }
fun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }
fun readLongs(n: Int) = List(n) { read().toLong() }
fun readLongArray(n: Int) = LongArray(n) { read().toLong() }

@JvmField val _writer = PrintWriter(OUTPUT, false)

/** shuffles and sort overrides to avoid quicksort attacks */
private inline fun <T> _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {
    // Fisher-Yates shuffle algorithm
    for (i in size - 1 downTo 1) {
        val j = rnd.nextInt(i + 1)
        val temp = get(i)
        set(i, get(j))
        set(j, temp)
    }
}

@JvmField var _random: Random? = null
val random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }

fun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
fun IntArray.sort() { shuffle(); _sort() }
fun IntArray.sortDescending() { shuffle(); _sortDescending() }

fun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
fun LongArray.sort() { shuffle(); _sort() }
fun LongArray.sortDescending() { shuffle(); _sortDescending() }

fun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
fun DoubleArray.sort() { shuffle(); _sort() }
fun DoubleArray.sortDescending() { shuffle(); _sortDescending() }

fun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)
inline fun CharArray.sort() { _sort() }
inline fun CharArray.sortDescending() { _sortDescending() }

inline fun <T: Comparable<T>> Array<out T>.sort() = _sort()
inline fun <T: Comparable<T>> Array<out T>.sortDescending() = _sortDescending()
inline fun <T: Comparable<T>> MutableList<out T>.sort() = _sort()
inline fun <T: Comparable<T>> MutableList<out T>.sortDescending() = _sortDescending()

fun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }

/** additional commons */
inline fun <T> Iterable<T>.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }
inline fun <T> Sequence<T>.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }
inline fun <T> Array<T>.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }
fun IntArray.sumLong() = fold(0L, Long::plus)


Measured memory_bytes: 88012