//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

  using i8 = std::int_fast8_t;
  using i32 = std::int_fast32_t;
  using i64 = std::int_fast64_t;
  using u8 = std::uint_fast8_t;
  using u32 = std::uint_fast32_t;
  using u64 = std::uint_fast64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f) : f(std::move(f)) {}
    template <class... Args> auto operator()(Args&&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';
  template <class T> T ceildiv(const T& l, const T& r) {
    return l / r + (l % r != 0 ? 1 : 0);
  }

} // namespace n91

#include <map>

namespace n91 {

  u64 iabs(const i64 x) { return x < 0 ? -x : x; }

  void solve() {
    const i64 n = scan<i64>();
    const u64 a = scan<u64>();
    const u64 b = scan<u64>();
    const u64 c = scan<u64>();
    const u64 d = scan<u64>();

    std::map<i64, u64> memo;
    memo[0] = 0;
    memo[1] = d;

    u64 ans = make_rec([a, b, c, d, &memo](const auto& f, const i64 n) -> u64 {
      {
        const auto itr = memo.find(n);
        if (itr != memo.end()) {
          return itr->second;
        }
      }

      //std::cout << n << eoln;

      u64 ret = std::numeric_limits<u64>::max() / 10;

      if (ret / d > iabs(n)) {
        ret = d * iabs(n);
      }

      // case 2
      {
        i64 rem = n % 2;
        if (rem < 0) {
          rem += 2;
        }
        if (rem == 0) {
          chmin(ret, f((n - rem) / 2) + a + d * iabs(rem));
        }
        else {
          chmin(ret, f((n - rem) / 2) + a + d * iabs(rem));
          rem -= 2;
          chmin(ret, f((n - rem) / 2) + a + d * iabs(rem));
        }
      }

      // case 3
      {
        i64 rem = n % 3;
        if (rem < 0) {
          rem += 3;
        }
        if (rem >= 2) {
          rem -= 3;
        }
        chmin(ret, f((n - rem) / 3) + b + d * iabs(rem));
      }

      // case 5
      {
        i64 rem = n % 5;
        if (rem < 0) {
          rem += 5;
        }
        if (rem >= 3) {
          rem -= 5;
        }
        chmin(ret, f((n - rem) / 5) + c + d * iabs(rem));
      }

      memo[n] = ret;

      return ret;
      })(n);

      std::cout << ans << eoln;
  }

  void main_() {
    /*
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //*/

    const usize t = scan<usize>();
    for (const usize i : rep(0, t)) {
      solve();
    }
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 4392