#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! flush {
    () => {
        std::io::stdout().flush().unwrap();
    };
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

struct DefaultMap<S, T> {
    data: std::collections::HashMap<S, T>,
    default: T,
}
impl<S: Eq + std::hash::Hash, T> DefaultMap<S, T> {
    fn new(default: T) -> DefaultMap<S, T> {
        DefaultMap {
            data: std::collections::HashMap::new(),
            default: default,
        }
    }
    fn keys(&self) -> std::collections::hash_map::Keys<S, T> {
        self.data.keys()
    }
    fn iter(&self) -> std::collections::hash_map::Iter<S, T> {
        self.data.iter()
    }
    fn len(&self) -> usize {
        self.data.len()
    }
}
impl<S: Eq + std::hash::Hash, T> std::ops::Index<S> for DefaultMap<S, T> {
    type Output = T;
    fn index(&self, key: S) -> &Self::Output {
        if let Some(val) = self.data.get(&key) {
            val
        } else {
            &self.default
        }
    }
}
impl<S: Eq + std::hash::Hash + Clone, T: Clone> std::ops::IndexMut<S> for DefaultMap<S, T> {
    fn index_mut(&mut self, key: S) -> &mut Self::Output {
        self.data.entry(key.clone()).or_insert(self.default.clone());
        self.data.get_mut(&key).unwrap()
    }
}

fn solve(
    n: u128,
    a: u128,
    b: u128,
    c: u128,
    d: u128,
    mut memo: &mut DefaultMap<u128, Option<u128>>,
) -> u128 {
    if n == 0 {
        return 0;
    }
    if n == 1 {
        return d;
    }
    if let Some(ans) = memo[n] {
        return ans;
    }
    let mut ans = n * d;
    ans = min!(
        ans,
        (n - (n / 2) * 2) * d + a + solve(n / 2, a, b, c, d, &mut memo)
    );
    ans = min!(
        ans,
        ((n + 1) / 2 * 2 - n) * d + a + solve((n + 1) / 2, a, b, c, d, &mut memo)
    );
    ans = min!(
        ans,
        (n - (n / 3) * 3) * d + b + solve(n / 3, a, b, c, d, &mut memo)
    );
    ans = min!(
        ans,
        ((n + 2) / 3 * 3 - n) * d + b + solve((n + 2) / 3, a, b, c, d, &mut memo)
    );
    ans = min!(
        ans,
        (n - (n / 5) * 5) * d + c + solve(n / 5, a, b, c, d, &mut memo)
    );
    ans = min!(
        ans,
        ((n + 4) / 5 * 5 - n) * d + c + solve((n + 4) / 5, a, b, c, d, &mut memo)
    );
    memo[n] = Some(ans);
    ans
}

fn main() {
    let mut sc = Scanner::new();
    let t: usize = sc.cin();
    for _ in 0..t {
        let n: u128 = sc.cin();
        let a: u128 = sc.cin();
        let b: u128 = sc.cin();
        let c: u128 = sc.cin();
        let d: u128 = sc.cin();
        let mut memo = DefaultMap::new(None);
        put!(solve(n, a, b, c, d, &mut memo));
    }
}

use std::collections::VecDeque;
use std::io::{self, Write};
use std::str::FromStr;

struct Scanner {
    stdin: io::Stdin,
    buffer: VecDeque<String>,
}
impl Scanner {
    fn new() -> Self {
        Scanner {
            stdin: io::stdin(),
            buffer: VecDeque::new(),
        }
    }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.is_empty() {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> {
        self.cin::<String>().chars().collect()
    }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.cin()).collect()
    }
}


Measured memory_bytes: 3348