#include<bits/stdc++.h>
#define LL long long
using namespace std;
const LL INF = 1e18;
vector<];
];
LL K;

///DFS构造以集合内质数为因子的数，注意DFS的写法，可以做到不重复
void DFS(int L, int R, LL val, const int idx)
{
    vet[idx].push_back(val);
    for(int i=L; i<=R; i++)
        if(INF / (LL)num[i] >= val)
            DFS(i, R, val*(LL)num[i], idx);
}

LL Order(LL NUM)
{
    ;
    LL cnt = ;
    ].size()-; i>=; i--){///双指针技巧
        ].size() &&
              vet[][j] <= NUM / vet[][i])///不等式右边是逐渐变大的
                j++;
        cnt += j;
    }
    return cnt;
}

int main(void)
{
    scanf("%d", &N);
    ; i<=N; i++)
        scanf("%d", &num[i]);
    scanf("%I64d", &K);

    sort(num+, num++N);
    ,j=N; i<j; i+=,j-=)
        swap(num[i], num[j]);

    DFS(, min(, N), , );
    DFS(min(, N)+, N, , );

    sort(vet[].begin(), vet[].end());
    sort(vet[].begin(), vet[].end());

    LL L = , R = INF, mid, ans;
    while(L <= R){
        mid = L + ((R - L)>>);
        ;
        ;
    }

    );
}