#include<bits/stdc++.h>
using namespace std;

int n, arr[1000],INF = 999999;
int mem[1000][1000];

int CoinChange(int idx, int b)
{
    if(b==0) return 0;
    if(idx>n-1) return INF;
    if(mem[idx][b] != -1) return mem[idx][b];
    int a = CoinChange(idx+1, b);
    int c;
    if(arr[idx] <= b)
        c = CoinChange(idx, b-arr[idx]) + 1;
    else c = INF;
    return mem[idx][b] = min(a,c);
}

int main()
{
    int b;
    memset(mem,-1,sizeof(mem));
    printf("How many coin: ");
    scanf("%d",&n);
    printf("enter those coin: ");
    for(int i=0;i<n;i++)
        scanf("%d",&arr[i]);
    printf("koy taka banaben?: ");
    scanf("%d",&b);
    int ans = CoinChange(0,b);
    if(ans==INF) printf("Impossible\n");
    else printf("%d\n",ans);
    return 0;
}