DEBUG = ARGV[0] == '-d'

def log(&msg)
  $stderr.puts "# #{msg.call}" if DEBUG
end

class Resolver

  def self.init(a, b, c, d)
    log { "A = #{a}, B = #{b}, C = #{c}, D = #{d}" }
    @@resolved = { 0 => 0, 1 => d }
    log { "n = 1, pay: D = #{d}" }
    if a + d < d * 2
      @@resolved[2] = a + d
      log { "n = 2, pay: A + D = #{a + d}" }
    else
      @@resolved[2] = d * 2
      log { "n = 2, pay: 2D = #{d * 2}" }
    end
    @@label_map = {
      "A" => a,
      "B" => b,
      "C" => c,
      "D" => d,
    }
  end

  def self.resolved
    @@resolved
  end

  def self.label_map
    @@label_map
  end

  class Calc

    MUL = {
      "A" => 2,
      "B" => 3,
      "C" => 5,
    }

    attr_reader :next_n

    def initialize(next_n, cur_pay, abc, d_cnt)
      @next_n = next_n
      @cur_pay = cur_pay
      total_pay
      if DEBUG
        d = Resolver.label_map["D"]
        if abc
          @label = "#{abc}#{MUL[abc]}(#{Resolver.label_map[abc]})"
          if d_cnt > 0
            @label += " + #{d_cnt}D(#{d_cnt}*#{d})"
          end
        elsif d_cnt
          @label = "#{d_cnt}D(#{d_cnt}*#{d})"
        end
        # log { "Register: #{to_s}" }
      end
    end

    def total_pay
      if @total_pay.nil? && @next_pay = Resolver.resolved[@next_n]
        @total_pay = @next_pay + @cur_pay
      end
      @total_pay
    end

    def to_s
      "# next_n = #{@next_n}, total pay = #{@total_pay}, cur pay: #{@label} = #{@cur_pay}"
    end
  end

  attr_reader :n, :resolved

  def initialize(n)
    @n = n
    @resolved = nil
    @stack = []
  end

  def register(next_n, cur_pay, abc, d_cnt)
    return if abc && next_n == 0
    @stack.push(Calc.new(next_n, cur_pay, abc, d_cnt))
  end

  def resolve
    if calc = @stack.find {|c| c.total_pay.nil? }
      calc.next_n
    else
      calc = @stack.min {|a, b| a.total_pay <=> b.total_pay }
      @resolved = @@resolved[@n] = calc.total_pay
      if DEBUG
        log { "[n = #{@n}, pay = #{@resolved}]" }
        @stack.each do |c|
          $stderr.puts c
        end
      end
      nil
    end
  end
  
end

class Entry
  attr_reader :n, :a, :b, :c, :d, :cache

  def initialize(line)
    @n, @a, @b, @c, @d = line.split.map {|i| i.to_i }
  end

  def pay
    Resolver.init(@a, @b, @c, @d)
    resolvers = []
    r = Resolver.new(@n)
    loop do
      n = r.n
      nn2, nm2 = n.divmod(2)
      p2c = @a + nm2 * @d
      r.register(nn2, p2c, "A", nm2)
      if nm2 > 0
        r.register(nn2 + 1, p2c, "A", nm2)
      end
      nn3, nm3 = n.divmod(3)
      p3c1 = @b + nm3 * @d
      p3c2 = @b + (3 - nm3) * @d
      r.register(nn3, p3c1, "B", nm3)
      r.register(nn3 + 1, p3c2, "B", 3 - nm3)
      nn5, nm5 = n.divmod(5)
      p5c1 = @c + nm5 * @d
      p5c2 = @c + (5 - nm5) * @d
      r.register(nn5, p5c1, "C", nm5)
      r.register(nn5 + 1, p5c2, "C", 5 - nm5)
      p1 = n * @d
      r.register(0, p1, nil, n)
      if next_n = r.resolve
        resolvers.push(r)
        r = Resolver.new(next_n)
      else
        loop do
          if resolvers.empty?
            return r.resolved
          end
          if next_n = resolvers[-1].resolve
            break
          end
          r = resolvers.pop
        end
        r = Resolver.new(next_n)
      end
    end
  end
end

T = $stdin.gets.to_i
0.upto(T - 1) do |i|
  e = Entry.new($stdin.gets)
  p = e.pay
  puts p
  log { p }
  log { "-" * 70 }
end


Measured memory_bytes: 15524