#include <bits/stdc++.h> 

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

VI row;
vector<VI> rows[8];

void gen()
{
	rows[SZ(row)].PB(row);
	if (SZ(row) == 7)
		return;
	FOR(val, row.empty() ? 1 : row.back(), 8)
	{
		row.PB(val);
		gen();
		row.pop_back();
	}
}

int k;

void solve()
{
	VI l(k);
	for (int& li : l)
		cin >> li;
	int n;
	cin >> n;
	vector<LL> dp(SZ(rows[l[0]]));
	FOR(j, 0, SZ(rows[l[0]]))
		if (rows[l[0]][j].back() <= n)
			dp[j] = 1;
	FOR(i, 0, k - 1)
	{
		vector<LL> ndp(SZ(rows[l[i + 1]]));
		FOR(j1, 0, SZ(rows[l[i]]))
		{
			FOR(j2, 0, SZ(rows[l[i + 1]]))
			{
				bool ok = rows[l[i + 1]][j2].back() <= n;
				FOR(p, 0, l[i + 1])
				{
					ok &= rows[l[i]][j1][p] < rows[l[i + 1]][j2][p];
				}
				if (ok)
					ndp[j2] += dp[j1];
			}
		}
		dp = ndp;
	}
	cout << accumulate(ALL(dp), 0LL) << "\n";	
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	gen();
	while (cin >> k)
		solve();
	return 0;
}