package main
import (
  "bufio"
  "os"
  "strconv"
  "strings"
  "fmt"
  "container/heap"
)

type Item struct {
  Priority int
  Entry interface{}
}
type Heap []*Item
func (H Heap) Len() int { return len(H) }
func (H Heap) Less(i, j int) bool { return H[i].Priority < H[j].Priority }
func (H Heap) Swap(i, j int) { H[i], H[j] = H[j], H[i] }
func (H *Heap) Pop() interface{} {
  Old := *H
  n := len(Old)
  item := Old[n - 1]
  *H = Old[0:n - 1]
  return item
}
func (H *Heap) Push(x interface{}) {
  item := x.(*Item)
  *H = append(*H, item)
}
type PriorityQueue struct {
  Comparator func(e interface{}) int
  Items Heap
}
func (PQ *PriorityQueue) Push(e interface{}) {
  item := Item{PQ.Comparator(e), e}
  heap.Push(&PQ.Items, &item)
}
func (PQ *PriorityQueue) Pop() interface{} {
  return heap.Pop(&PQ.Items).(*Item).Entry
}
func (PQ *PriorityQueue) Len() int { return PQ.Items.Len() }
func InitPQ(F func(interface{}) int) PriorityQueue {
  var H Heap
  return PriorityQueue{F, H}
}

func Solve() {
  var T, N, D, a, c, n, C, m int
  var q []int
  var ok bool
  ABC := make([]int, 3)
  F := func(e interface{}) int { return e.([]int)[0] }
  K := []int{2, 3, 5}
  NextInt(&T)
  for t := 0; t < T; t++ {
    NextInt(&N, &ABC[0], &ABC[1], &ABC[2], &D)
    M := make(map[int]int)
    M[N] = 0
    PQ := InitPQ(F)
    PQ.Push([]int{0, N})
    for 0 < PQ.Len() {
      q = PQ.Pop().([]int)
      c, n = q[0], q[1]
      if M[n] < c { continue }
      for i, k := range K {
        a = n % k
        if a == 0 {
          C = c + ABC[i]
          if n - n/k < 1000000000 { C = MinInt(c + (n - n/k) * D, C) }
          if m, ok = M[n/k]; !ok || C < m {
            M[n/k] = C
            PQ.Push([]int{C, n/k})
          }
        } else {
          C = c + a * D
          if m, ok = M[n - a]; !ok || C < m {
            M[n - a] = C
            PQ.Push([]int{C, n - a})
          }
          C = c + (k - a) * D
          if m, ok = M[n + k - a]; !ok || C < m {
            M[n + k - a] = C
            PQ.Push([]int{C, n + k - a})
          }
        }
      }
    }
    Write(M[0])
  }
}

func main() {
  Solve()
  Output()
}

var reader = bufio.NewReaderSize(os.Stdin, 1000000)
var writer = bufio.NewWriter(os.Stdout)
func NextLine() string {
  buffer := make([]byte, 0)
  for true {
    line, isPrefix, err := reader.ReadLine()
    if err != nil { panic(err) }
    buffer = append(buffer, line...)
    if !isPrefix { break }
  }
  return string(buffer)
}
func NextInt(A ...*int) {
  L := strings.Split(NextLine(), " ")
  for i, a := range A {
    *a, _ = strconv.Atoi(L[i])
  }
}
func NextIntVec(A *[]int) {
  L := strings.Split(NextLine(), " ")
  (*A) = make([]int, len(L))
  for i, l := range L {
    (*A)[i], _ = strconv.Atoi(l)
  }
}
func NextFloat(A ...*float64) {
  L := strings.Split(NextLine(), " ")
  for i, a := range A {
    *a, _ = strconv.ParseFloat(L[i], 64)
  }
}
func NextFloatVec(A *[]float64) {
  L := strings.Split(NextLine(), " ")
  (*A) = make([]float64, len(L))
  for i, l := range L {
    (*A)[i], _ = strconv.ParseFloat(l, 64)
  }
}
func Write(s interface{}) {
  fmt.Fprintln(writer, s)
}
func WriteIntVec(A []int) {
  S := make([]string, len(A))
  for i, a := range A {
    S[i] = strconv.Itoa(a)
  }
  Write(strings.Join(S, " "))
}
func Output() {
  _ = writer.Flush()
}
func MaxInt(A ...int) int {
  max := A[0]
  for _, a := range A {
    if max < a { max = a }
  }
  return max
}
func MinInt(A ...int) int {
  min := A[0]
  for _, a := range A {
    if a < min { min = a }
  }
  return min
}
func SumInt(A ...int) int {
  sum := 0
  for _, a := range A {
    sum += a
  }
  return sum
}
func AbsInt(x int) int {
  if x < 0 { x = -x }
  return x
}

Measured memory_bytes: 26012