1986D - Mathematical Problem - CodeForces Solution

from math import ceil, gcd, sqrt, floor
from collections import Counter, defaultdict, deque
import heapq
from math import ceil,log2; 

def modM(a, b, M):
    return (a%M * b%M)%M

def gL(): return list(map(int, input().split()))

def gT(): return tuple(map(int, input().split()))

def gI(): return int(input())

def pR(ok): 
    if ok:
        print("yes")
    else:
        print("no")



tt = 1
tt = int(input())
def solve():
    n = gI()
    a = list(input())
    res = float('inf')

    for i in range(n-1):
        temp = []
        tot = 0
        j = 0
        while j < n:
            curr = []
            curr.append(a[j])
            if i == j:
                curr.append(a[j+1])
                j += 1
            temp.append(''.join(curr))
            j += 1


        tot = int(temp[0])
        for j in range(1, len(temp)):
            tot = min(tot * int(temp[j]), tot + int(temp[j]))

                res = min(res, tot)

    print(res)





for i in range(tt):
    solve()