#include<bits/stdc++.h>
using namespace std;
#include<atcoder/convolution>
#include<atcoder/modint>
typedef atcoder::modint998244353 mint;
typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int op(int a, int b){
	int ret = 0;
	vector<int> c;
	rep(i,0,6){
		c.push_back((a+b) % 10);
		a /= 10;
		b /= 10;
	}
	rrep(i,0,6){
		ret = ret * 10 + c[i];
	}
	return ret;
}

int main(){
	vector<int> a(6);
	rep(i,0,6){
		cin >> a[i];
	}

	vector<vector<mint>> seisei(6, vector<mint>(1000000));
	rep(i,0,6){
		int x = a[i];
		seisei[i][x] = 1;
		while(true){
			x = op(x, a[i]);
			if (seisei[i][x].val() == 1) break;
			seisei[i][x] = 1;
		}
	}

	vector<mint> ans(1000000);
	ans[0] = 1;
	rep(i,0,6){
		ans = atcoder::convolution(ans, seisei[i]);
		vector<mint> nans(1000000);
		rep(i,0,(int)ans.size()){
			if (ans[i].val() > 0) {
				nans[i % 1000000] = 1;
			}
		}
		swap(ans, nans);
	}

	cout << sum(ans).val() << '\n';

}