#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <ctime>
#include <cctype>

using namespace std;
typedef long long int64;
const int inf = 0x3f3f3f3f;
typedef double real;
const real eps = 1e-6;
typedef pair<int64,int> pip;
#define Eo(x) { cerr << #x << " = " << (x) << endl; }
typedef __int128_t int128;

template<typename T>
T gcd(const T& a, const T& b) {
  return a == 0 ? b : gcd(b%a,a);
}

template<typename T>
bool isprime(const T& k){
  for (T i = 2;i*i<=k;i++)if ((k%i)==0) return false;
  return true;
}

template<typename T>
T mabs(const T& x) {
  if (x>=0) return x;
  return -x;
}

ostream& operator<<(ostream& os, int128 k) {
  if (!k) return os << '0';
  string s;
  for (;k;k/=10) s = char((k%10)+'0')+s;
  return os << s;
}

#define PRIMES 0
#if PRIMES
vector<int> primes;
void factorize(int64 x, map<int64,int>& all){
  int i;
  for (i = 0;i<primes.size()&&int64(primes[i])*primes[i]<=x;i++)if (!(x%primes[i])){
    int q = 0;
    for (;!(x%primes[i]);x/=primes[i],q++);
    all[primes[i]]+=q;
  }
  assert(i<primes.size());
  if (x>1)all[x]++;
}
const int maxn = 1<<27;
char isp[maxn];
#endif

int go(pip a, pip b, int z) {
  if (a.first <= z && a.second > z && b.first <= z && b.second > z) {
    return min(a.second,b.second)-max(a.first,b.first);
  }
  return -1;
}

int main(){
#if PRIMES
  memset(isp,1,sizeof(isp));
  isp[0]=isp[1]=0;
  for (int i = 2; i*i<maxn;i++)if(isp[i])
    for (int j = i*i;j<maxn;j+=i)isp[j]=0;
  for (int i= 2; i < maxn; i++) if (isp[i]) primes.push_back(i);
#endif
  int l1,l2,r1,r2; cin>>l1>>r1>>l2>>r2;
  r1++;r2++;
  vector<pip> a[2];
  a[0].push_back(pip(l1,r1));
  a[1].push_back(pip(l2,r2));
  int res = 0;
  for (int k = 29; k > 0; k--) {
    int z = (1<<k);
    for (int i = 0; i < a[0].size(); i++) {
      for (int j = 0; j < a[1].size(); j++) {
        res = max(res,go(a[0][i],a[1][j],z));
      }
    }
    for (int t = 0; t < 2; t++) {
      vector<pip> old = a[t];
      a[t].clear();
      for (int i = 0; i < old.size(); i++) {
        int l = old[i].first;
        int r = old[i].second;
        if (l>z){
          a[t].push_back(pip(l-z,r-z));
        } else if (r<=z){
          a[t].push_back(pip(l,r));
        } else if (l <= z && r > z) {
          a[t].push_back(pip(l,z));
          a[t].push_back(pip(z+1,r));
        }
      }
      if(a[t].size()==3){
        pip q = a[t][1];
        a[t].clear();
        a[t].push_back(q);
      }
    }
  }
  cout << res << endl;
  return 0;
}


#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9;

void bfs(int s, vector<vector<int>>& graph, vector<int>& dist, vector<set<int>>& par) {
    queue<int> q;
    q.push(s);
    dist[s] = 0;
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        for (int u : graph[v]) {
            if (dist[u] > dist[v] + 1) {
                dist[u] = dist[v] + 1;
                q.push(u);
            }
            if (dist[u] == dist[v] + 1) {
                par[u].insert(v);
            }
        }
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> graph(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        graph[v - 1].push_back(u - 1);
    }
    int k;
    cin >> k;
    vector<int> path(k);
    for (int i = 0; i < k; i++) {
        cin >> path[i];
        path[i]--;
    }
    vector<int> dist(n, INF);
    vector<int> cnt(n, 0);
    vector<set<int>> par(n);
    bfs(path[k - 1], graph, dist, par);
    int ans_min = 0, ans_max = 0;
    for (int i = 0; i < k - 1; i++) {
        if (par[path[i]].count(path[i + 1]) == 0) {
            ans_max++;
            ans_min++;
        } else {
            ans_max += min(par[path[i]].size() - 1, 1);
        }
    }
    cout << ans_min << ' ' << ans_max;
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define ed end()
#define bg begin()
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define all(x) (x).bg, (x).ed

const int N = 1e6 + 123, mod = 1e9 + 7;
const int inf = 2e9;
const ll INF = 2e18;

int n, m, d[N], k, p[N], cnt;
vector<int>g[N], gr[N];
bool u[N];

main() {

    cin >> n >> m;

    while(m--) {
        int x, y;
        cin >> x >> y;
        g[y].pb(x);
        gr[x].pb(y);
    }

    cin >> k;
    for(int i = 1; i <= k; i++)
        cin >> p[i];

    queue<int>q;
    u[p[k]] = 1;
    q.push(p[k]);
    while(!q.empty()) {
        int v = q.front();
        q.pop();
        for(int to : g[v]) {
            if(!u[to]) {
                u[to] = 1;
                q.push(to);
                d[to] = d[v] + 1;
            }
        }
    }

    for(int i = 1; i < k; i++) {
        int mn = inf;
        int v = p[i];
        for(int to : gr[v])
            mn = min(mn, d[to]);
        cnt += (mn != d[p[i + 1]]);
    }

    cout << cnt << ' ';
    for(int i = 1; i < k; i++) {
        int mn = inf;
        int v = p[i];
        for(int to : gr[v])
            mn = min(mn, d[to]);
        if(d[to] != mn) continue;
        int cur = 0;
        for(int to : gr[v])
            cur += (d[to] == mn);
        cnt += (cur > 1);
    }

    cout << cnt;

    return 0;
}


#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> gr, rgr, p;
vector<int> d;

void bfs(int v, int dist){
	for(int i = 0; i < rgr[v].size(); ++i){
		int u = rgr[v][i];
		if(d[u] == -1 || d[u] > dist + 1){
			p[u].clear();
			p[u].push_back(v);
			d[u] = dist + 1;
			bfs(u, dist + 1);
		}
		else{
			if(d[u] == dist + 1)
				p[u].push_back(v);
		}
	}
}

signed main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);

	int n, m;
	cin >> n >> m;
	gr.resize(n);
	rgr.resize(n);
	p.resize(n);
	d.resize(n, -1);
	for(int i = 0; i < m; ++i){
		int v, u;
		cin >> v >> u;
		gr[--v].push_back(--u);
		rgr[u].push_back(v);
	}
	int a;
	cin >> a;
	vector<int> path(a);
	for(int i = 0; i < a; ++i){
		cin >> path[i];
		--path[i];
	}

	queue<int>q;
	q.push(path.back());
	int dist = 0;
	while(!q.empty()){
		int n = q.size();
		for(int i = 0; i < n; ++i){
			int v = q.front();
			for(int i = 0; i < rgr[v].size(); ++i){
				int u = rgr[v][i];
				if(d[u] == -1 || d[u] > dist + 1){
					p[u].clear();
					p[u].push_back(v);
					d[u] = dist + 1;
					q.push(u);
				}
				else{
					if(d[u] == dist + 1)
						p[u].push_back(v);
				}
			}
			q.pop();
		}
		++dist;
	}
	int min = 0, max = 0;
	for(int i = 1; i < a; ++i){
		if(find(p[path[i - 1]].begin(), p[path[i - 1]].end(), path[i]) == p[path[i - 1]].end()){
			++min;
			++max;
		}
		else{
			if(p[path[i - 1]].size() > 1)
				++max;
		}
	}
        printf("%d %d", min, max);
        endl;
}


#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>

using namespace std;

void task_a()
{
    int n; cin >> n;
    vector<int> r(n);
    for (int i = 0; i < n; i++)
    {
        cin >> r[i];
    }

    vector<int> b(n);
    for (int i = 0; i < n; i++)
    {
        cin >> b[i];
    }

    int r_cnt = 0, b_cnt = 0;
    bool same = true;
    for (int i = 0; i < n; i++)
    {
        same = same && (r[i] == b[i]);
        if (r[i] > b[i])
            r_cnt += r[i];
        if (b[i] > r[i])
            b_cnt += b[i];
    }

    if (same || r_cnt == 0)
    {
        cout << -1;
    }
    else
    {
        if (b_cnt % r_cnt == 0)
            cout << b_cnt / r_cnt + 1;
        else
            cout << (r_cnt + b_cnt - 1) / r_cnt;
    }
}

void task_b()
{
    int n; cin >> n;
    map<int,long long> cnt; // d b
    for (int i = 0; i < n; i++)
    {
        int x; cin >> x;
        cnt.insert(pair<int,long long>(i-x, 0)).first->second += x;
    }
    long long res = 0;
    for(map<int,long long>::iterator it = cnt.begin(); it != cnt.end(); it++)
    {
        res = max(res, it->second);
    }
    cout << res;
}

void print(const vector<int>& vec);

string er(const string& s, const vector<int>& ind)
{
    if (ind.size() == 0) return s;
    string res(s.length()-ind.size(), ' ');
    for (int i = 0, j = 0, k = 0; i < s.length(); i++, j++)
    {
        if (k < ind.size() && ind[k] == i)
        {
            k++; j--;
            continue;
        }

        res[j] = s[i];

    }
    return res;
}

vector<int> find2d(const string& s, char c)
{
    vector<int> res;
    if (s.length() == 0) return res;
    if (s[0] == c && s[1] == c - 1)
    {
        res.push_back(0);
    }
    int n = s.length() - 1;
    for (int i = 1; i < n; i++)
    {
        if(s[i] == c)
        {
            if (s[i-1] == c - 1 || s[i+1] == c - 1)
            {
                res.push_back(i++);
            }
        }
    }
    if (s[n] == c && s[n - 1] == c - 1)
    {
        res.push_back(0);
    }
    return res;
}

void print(const vector<int>& vec)
{
    for (int i = 0; i < vec.size(); i++)
    {
        cout << vec[i] << " ";
    }
    cout << endl;
}

void task_c()
{
    int n; cin >> n;
    string s; cin >> s;
    for (char c = 'z'; c > 'a'; c--)
    {

        vector<int> v2d;
        do
        {
            v2d = find2d(s,c);
            s = er(s, v2d);
        } while(v2d.size() > 0);
        //cout << c << ":\t" << s << endl;
    }
    cout << n - s.length();
}

vector<int> bfs_v;
vector<int> bfs_val;

int bfs_d(int v, int d, const vector<vector<int> >& gr, vector<int>& depth)
{
    depth[v] = d;
    for (int i = 0; i < gr[v].size(); i++)
    {
        if (depth[gr[v][i]] == -1)
        {
            bfs_v.push_back(gr[v][i]);
            bfs_val.push_back(d+1);
        }
    }
}
/*
int bfs_c(int v, const vector<vector<int> >& gr, const vector<int>& depth)
{
    for (int i = 0; i < gr[v].size(); i++)
    {
        if (depth[gr[v][i]] == depth[v] - 1)
        {
            bfs_val[v] += bfs_val[gr[v][i]];
        }
    }
}*/

void task_d()
{
    ifstream cin("i.txt");
    int n,m; cin >> n >> m;
    vector<vector<int> > gr(n);
    for (int i = 0; i < m; i++)
    {
        int x,y; cin >> x >> y; x--;y--;
        gr[x].push_back(y);
    }

    int k; cin >> k;
    vector<int> path(k);
    for (int i = 0; i < k; i++)
    {
        cin >> path[i]; path[i]--;
    }

    vector<int> depth(n,-1);
    bfs_v.push_back(path[k-1]);
    bfs_val.push_back(0);
    for (int i = 0; i < n; i++)
    {
        bfs_d(bfs_v[i], bfs_val[i], gr, depth);
        //print(bfs_v);
    }

    //print(depth);
    /*bfs_val.resize(0);
    bfs_val.resize(n);

    /*vector<int> cnt(n);
    for (int i = 0; i < n; i++)
    {
        bfs_d(bfs_v[i], gr, depth);
    }*/

    int res_x = 0, res_n = 0;
    for (int i = 0; i+1 < k; i++)
    {
        int sh = n;
        for (int j = 0; j < gr[path[i]].size(); j++)
        {
            sh = min(sh, depth[gr[path[i]][j]]);
        }

        if (sh < depth[path[i+1]]) { res_x++; res_n++; continue; }

        int cnt = 0;
        for (int j = 0; j < gr[path[i]].size(); j++)
        {
            if (sh == depth[gr[path[i]][j]]) cnt++;
        }
        if (cnt > 1) res_x++;
    }
    cout << res_n << " " << res_x << endl;
    /**/
}

int main()
{
    //cout << fixed << setprecision(6);
    //
    task_d();
    return 0;
}


    #include<bits/stdc++.h>

    using namespace std;
    main()
    {
        int i,l,n,x,y;
        cin>>n >>x >>y;
        if(n==2)
            cout<<"NO";
        else if((n/x==2)&&(n/y==2))
            cout<<"NO";
        else
        cout<<"YES";


#include <iostream>
#include <bits/stdc++.h>
#include <mutex>
#include <thread>
#include <chrono>
#include <fstream>
using namespace std;

int main ()
{
  int m, r, c;
  cin >> m >> r >> c;

  int n = m/2;
  vector<pair<int, int>> p;
  for (int i = 0; i < m; i++)
  {
     p.emplace_back(i + 1, n);
     p.emplace_back(i + 2, n);

     p.emplace_back(n,  i + 1);
     p.emplace_back(n + 1, i + 1);
  }

  cout << (p.find(make_pair(r, c)) != p.end() ? "YES" : "NO") << "\n";
  return 0;
}


#incldue <bits/stdc++.h>

using namespace std;

int main()
{
    int n,a,b;
    cin >> n >> a >> b;
    if(n<=2||a==n/2&&b==n/2)
        cout << "NO" << endl;
    else
        cout << "YES" << endl;
}


#include<bits/stdc++.h>
using  namespace std;
int digitSum(long long temp)
{
	long long sum=0;
	while(n)
	{
		sum+=n%10;
		n/=10;
	}
	return sum;
}
int main()
{
	int n;
	cin>>n;
	long long temp=19;
	for(int i=1;i<n;temp+=9)
	{
		if(digitSum(temp)==10)
		i++;
	}
	//cout<<digitSum(100);
	cout<<temp;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int k;
    cin.tie(0);
    cin>>k;
    long l=19;
    k-=1;
    while(k)
    {
        if(k)
        {
            ++l;
            if(sum(l)==10)
                k--;
        }
    }
    cout<<l;
    return 0;
}


#include<iostream>
using namespace std;

int check(int n)
{ int sum=0;

  while(n>1)
  {sum=sum+(n%10);
   n=n/10;
  }

  if(sum==10)
  return 1;
  else return 0;
}

int main()
{ int k;
 cin>>k;

int count=1;

 for(i=1;i<=1000000;i++)
 {if(check(i)&&count==k)
  {cout<<i;
   break;}
   count++;
 }

  return 0;}


#include<bits/stdc++.h>
using namespace std;
int k;
int g[100][15];
int pd[25];
int dpt[1000000][15];

void preprocess(){

    pd[0]=1;
    for(int i=1;i<20;i++)pd[i]=10*pd[i-1];

    for(int i=0;i<100;i++){g[i][0]=1;}
    for(int i=1;i<100;i++){
        for(int j=1;j<=10;j++){
            for(int r=0;r<=9;r++){
                g[i][j]+=g[i-1][j-r];
            }
        }
    }
}

int dp(int num,int rem){
    if(rem==0)return 1;
    int l=log10(num);
    if(l<0)return 0;
    int d=(num/pd[l]);
    int nn=num-(d*pd[l]);
//    cout<<num<<" "<<l<<" "<<d<<" "<<nn<<endl;
    dpt[num][rem]=dp(nn,rem-d);
    for(int i=0;i<d;i++){
        dpt[num][rem]+=g[l][rem-i];
    }
    return dpt[num][rem];
}

int binarysearch(int pos){
    int l=1,r=100000;
    while(l<r){
        int mid=(l+r)/2;
        if(dp(mid,10)>pos){
            r=mid;
        }else{
            l=mid+1;
        }
    }
    return l;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
    preprocess();
    cin>>k;
    k--;1
//    cout<<dp(27,10);
    cout<<binarysearch( k);
return 0;}


#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef long long LL;
const int MAX = 1e5+10;
const int inf = 0x3f3f3f3f;
int solve(string time, int orc) {
    int hh=0,mm=0;
    hh = 10*(time[0]-'0')+time[1]-'0';
    mm = 10*(time[3]-'0')+time[4]-'0';
    int tot = hh*60+mm+orc;
    if(tot%60/24<10) {
        printf("0%d:",tot/60%24);
    }
    else{
        printf("%d:",tot/60%24);
    }
    if(tot%60<10) {
        printf("0%d\n",tot%60);
    }
    else{
        printf("%d\n",tot%60);
    }
    return 0;

}
int main() {
    string str;
    int ptr;
    cin>>str;
    cin>>ptr;
    solve(str, ptr);
}


#include <iostream>
using namespace std;
int main()
{
    int hh,mm;
    char s;
    int a;
    cin >> hh >> s >> m;
    cin >> a;
    int h=0,m=0;
    if (a>=60)
    {
    h+=a/60;
    m+=a-h*60;
    }
    else
    m+=a;
    cout << hh+h << s << mm+m;
    return 0;
}


#include <iostream>
using namespace std;

typedef pair<int, int> pii;
typedef complex<double> point;

const double pi = acos(-1);
const int md = 1000 * 1000 * 1000 + 7;
const int o = 1000 * 1000 * 1000;
const int oo = o * o;
const double eps = 1e-7;

string s;
int h, m;
int p;

main() {
	slowdown;
	cin.tie(0);

	cin >> s;
	cin >> p;
	h = (s[0] - '0') * 10 + (s[1] - '0');
	m = (s[3] - '0') * 10 + (s[4] - '0');

	m += p;
	h += m / 60;
	m %= 60;
	h %= 24;

	if(h < 10)
		cout << 0;
	cout << h << ":";
	if (m < 10)
		cout << 0;
	cout << m << endl;

	return 0;
}


#include <iostream>

using namespace std;

void main()
{
	int h; int m;
	int a;
	cin >> h >> m >> a;
	a += m;
	h += (a / 60);
	h = h % 24;
	m = a % 60;
	if (h < 10)
	{
		cout << 0 << h << ":";
	}
	else
	cout << h << ":";
	if (m < 10)
		cout << 0 << m;
	else
		cout << m;
}


#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
using namespace std;

const int N = 7;
const int MOD = (int)1e9 + 7;

void add_to(int & a, int b)
{
	a += b;
	if (a >= MOD)
		a -= MOD;
}

int mul(int a, int b)
{
	long long c = (long long)a * b;
	return (int)(c % MOD);
}

struct Matrix
{
	int SZ;
	int a[1 << N][1 << N];

	explicit Matrix(int size, int e = 0) : a()
	{
		SZ = size;
		for (int i = 0; i < SZ; i++)
			a[i][i] = e;
	}

	int * operator [] (int p)
	{
		return a[p];
	}

	const int * operator [] (int p) const
	{
		return a[p];
	}

	Matrix operator * (const Matrix & b)
	{
		Matrix c(SZ);
		for (int i = 0; i < SZ; i++)
			for (int j = 0; j < SZ; j++)
				for (int k = 0; k < SZ; k++)
					add_to(c[i][j], mul(a[i][k], b[k][j]));
		return c;
	}
};

Matrix bin_pow(Matrix a, int b)
{
	Matrix c(a.SZ, 1);
	while (b > 0)
	{
		if (b % 2 == 1)
			c = c * a;
		a = a * a;
		b /= 2;
	}
	return c;
}

int width[N];
int dp[1 << N];
int loc[N + 1][2];

bool bit(int a, int b)
{
	return (a & (1 << b)) != 0;
}

int get_ways(int lvl, int left, int right)
{
	memset(loc, 0, sizeof(loc));
	loc[0][1] = 1;

	for (int i = 0; i < lvl; i++)
		for (int j = 0; j < 2; j++)
			for (int k = 0; k < 2; k++)
			{
				if (bit(left, i) && bit(right, i) && j == 1 && k == 1)
					continue;
				add_to(loc[i + 1][k], loc[i][j]);
			}

	return loc[lvl][1];
}

void solve()
{
	for (int i = 0; i < N; i++)
		scanf("%d", &width[i]);

	dp[0] = 1;
	int prev_lvl = 0;

	for (int lvl = 1; lvl <= N; lvl++)
	{
		if (width[lvl - 1] == 0)
			continue;

		Matrix vec(1 << lvl);
		for (int mask = 0; mask < (1 << prev_lvl); mask++)
		{
			int new_mask = mask;
			for (int i = prev_lvl; i < lvl; i++)
				new_mask |= (1 << i);
			vec[0][new_mask] = dp[mask];
		}

		Matrix mat(1 << lvl);
		for (int from = 0; from < (1 << lvl); from++)
			for (int to = 0; to < (1 << lvl); to++)
				mat[from][to] = get_ways(lvl, from, to);

		mat = bin_pow(mat, width[lvl - 1]);
		vec = vec * mat;
		for (int mask = 0; mask < (1 << lvl); mask++)
			dp[mask] = vec[0][mask];

		prev_lvl = lvl;
	}

	int ans = dp[(1 << prev_lvl) - 1];
	printf("%d\n", ans);
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif

	solve();
	return 0;
}


//#include<khoda>
#include<bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;
const ll mod = 1e9+7;

struct Matris{
    ll A[130][130]; //TODO
    ll n , m;
    Matris(){
        clr();
    }
    void clr(){
        memset(A,0,sizeof A);
    }
    ll* operator[](int x)
    {
        return A[x];
    }
};

Matris A;
ll w[10];

Matris operator*( Matris a , Matris b )
{
    Matris ans;
    ans.n = a.n; ans.m = b.m;
    for ( int i = 0 ; i < ans.n ; i++ )
    {
        for ( int j = 0 ; j < ans.m ; j++ )
        {
            for ( int k = 0 ; k < a.m ; k++ )
            {
                ans[i][j] += (1LL*a[i][k] * b[k][j])%mod;
                ans[i][j] %= mod;
            }
        }
    }
    return ans;
}

bool ok( int i , int j , int k )
{
    for ( int t = 1 ; t <= 7 ; t++ )
    {
        if ( i % 2 == 1 && j % 2 == 1 && k % 2 == 1 && ( k / 2 ) % 2 == 1 )
        {
            return false;
        }
        i /= 2;
        j /= 2;
        k /= 2;
    }
    return true;
}

void make_mat( int K )
{
    A.clr();
    for ( int i = ( 1 << 7 ) - ( 1 << K ) ; i < ( 1 << 7 ) ; i++ )
    {
        for ( int j = ( 1 << 7 ) - ( 1 << K ) ; j < ( 1 << 7 ) ; j++ )
        {
            for ( int k = 0 ; k < ( 1 << K ) ; k++ )
            {
                if ( ok( i , j , ( 1 << K ) + k ) && k % 2 == 1 )
                {
                    A[i][j]++;
                    //cout << i << " " << j << endl;
                }
            }
        }
    }
}

Matris powm( Matris a , int b )
{
    Matris ans;
    ans.n = a.n; ans.m = a.m;
    for ( int i = 0 ; i < ( 1 << 7 ) ; i++ )
    {
        ans[i][i] = 1;
    }
    while( b )
    {
        if ( b & 1 )
        {
            ans = ans * a;
        }
        a = a * a;
        b /= 2;
    }
    return ans;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    for ( int i = 1 ; i <= 7 ; i++ ){ cin>>w[i]; }
    Matris B; B.n = 128; B.m = 1; B[127][0] = 1;
    A.n = ( 1 << 7 ); A.m = ( 1 << 7 );
    for ( int i = 1 ; i <= 7 ; i++ )
    {
        make_mat( i );
        B = powm( A , w[i] ) * B;
    }
    cout << B[127][0];
    return 0;
}


// problem498E.cpp : Defines the entry point for the console application.
//

#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>

typedef long long llong;
const llong prime = 1000000007;
llong ans = 0;
llong h[2][128][128];

llong f[128], f_tmp[128];
llong a1[128][128], b1[128][128];
unsigned int widths[7];
unsigned int curH = 1;

void init();
void updateMask(unsigned int aCurHeight);
void mat_vec_Mult(unsigned int aCurH, unsigned int aPrevH);
void mat_mat_Mult(unsigned int aCurH);

int main()
{
	init();
	unsigned int prevH = 0;

	for(unsigned int i = curH; i <= 7; ++ i)
	{
		if(widths[i - 1])
		{
			unsigned int w = widths[i-1] - 1;
			std::memcpy(a1, &h[1][0][0], 128 * 128 * sizeof(llong));
			mat_vec_Mult(i, prevH);
			prevH = i;
			unsigned int mask = 1;
			for(unsigned int j = w; j != 0; mask <<= 1)
			{
				if(mask & j)
				{
					mat_vec_Mult(i, i);
					j ^= mask;
				}
				mat_mat_Mult(i);
			}
		}
		if(i < 7)
		{
			updateMask(i + 1);
		}
	}

	std::cout<< f[(1 << prevH) - 1] << std::endl;
	return 0;
}

void updateMask(unsigned int aCurHeight)
{
	unsigned int diff = 1 << (aCurHeight - 1);
	for(unsigned int i = 0; i < diff; ++ i)
	{
		for(unsigned int j = 0; j < diff; ++ j)
		{
			llong t0 = h[0][i][j];
			llong t1 = h[1][i][j];
			h[0][i][j] = h[0][i + diff][j] = h[0][i][j + diff] = h[1][i][j] = h[1][i][j + diff] = h[1][i + diff][j] = t0 + t1;
			h[0][i + diff][j + diff] = t0 + t1;
			h[1][i + diff][j + diff] = t0;
		}
	}
}

void init()
{
	for(unsigned int i = 0; i < 7; ++ i)
	{
		std::cin >> widths[i];
	}
	memset(h, 0, 128 * 128 * 2 * sizeof(llong));
	h[0][0][0] = h[0][0][1] = h[0][1][0] = h[1][0][0] = h[1][0][1] = h[1][1][0] = h[0][1][1] = 1;
	h[1][1][1] = 0;
	memset(a1, 0, 128 * 128 * sizeof(llong));
	memset(b1, 0, 128 * 128 * sizeof(llong));
	memset(f, 0, 128 * sizeof(llong));
	memset(f_tmp, 0, 128 * sizeof(llong));

	for(unsigned int i = 1; widths[i - 1] == 0; ++ i)
	{

		curH ++;
		updateMask(i + 1);
	}

	f[0] = 1;
}

void mat_mat_Mult(unsigned int aCurH)
{
	unsigned int ceil = 1 << aCurH;
	for(unsigned int i1 = 0; i1 < ceil; ++ i1)
	{
		for(unsigned int i2 = 0; i2 < ceil; ++ i2)
		{
			llong val = 0;
			for(unsigned int i3 = 0; i3 < ceil; ++ i3)
			{
				 val = (val + a1[i1][i3] * a1[i2][i3]) % prime;
			}

			b1[i1][i2] = val;
		}
	}
	std::memcpy(a1, b1, sizeof(llong) * 128 * 128);
}

void mat_vec_Mult(unsigned int aCurH, unsigned int aPrevH)
{
	unsigned int n1 = 1 << aCurH ;
	unsigned int n2 = 1 << aPrevH;
	unsigned int mask = (n1 - 1) ^ (n2 - 1);

	for(unsigned int i1 = 0; i1 < n1; ++ i1)
	{
		llong val = 0;
		for(unsigned int i2 = 0; i2 < n2; ++ i2)
		{
			val = (val + f[i2] * a1[i1][i2 | mask]) % prime;
		}
		f_tmp[i1] = val % prime;
	}
	std::memcpy(f, f_tmp, sizeof(llong) * 128);
}


#pragma GCC optimize ("Ofast")
#pragma GCC target("popcnt,abm,mmx,sse,sse2,sse3,ssse3,sse4,avx,avx2")

#include<bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000
#define MOD 998244353
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,k;
const double PI=acos(-1.0);
namespace fft
{
    struct num
    {
        double x,y;
        num() {x=y=0;}
        num(double x,double y):x(x),y(y){}
    };
    inline num operator+(num a,num b) {return num(a.x+b.x,a.y+b.y);}
    inline num operator-(num a,num b) {return num(a.x-b.x,a.y-b.y);}
    inline num operator*(num a,num b) {return num(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
    inline num conj(num a) {return num(a.x,-a.y);}

    int base=1;
    vector<num> roots={{0,0},{1,0}};
    vector<int> rev={0,1};
    const double PI=acosl(-1.0);

    void ensure_base(int nbase)
    {
        if(nbase<=base) return;
        rev.resize(1<<nbase);
        for(int i=0;i<(1<<nbase);i++)
            rev[i]=(rev[i>>1]>>1)+((i&1)<<(nbase-1));
        roots.resize(1<<nbase);
        while(base<nbase)
        {
            double angle=2*PI/(1<<(base+1));
            for(int i=1<<(base-1);i<(1<<base);i++)
            {
                roots[i<<1]=roots[i];
                double angle_i=angle*(2*i+1-(1<<base));
                roots[(i<<1)+1]=num(cos(angle_i),sin(angle_i));
            }
            base++;
        }
    }

    void fft(vector<num> &a,int n=-1)
    {
        if(n==-1) n=a.size();
        assert((n&(n-1))==0);
        int zeros=__builtin_ctz(n);
        ensure_base(zeros);
        int shift=base-zeros;
        for(int i=0;i<n;i++)
            if(i<(rev[i]>>shift))
                swap(a[i],a[rev[i]>>shift]);
        for(int k=1;k<n;k<<=1)
        {
            for(int i=0;i<n;i+=2*k)
            {
                for(int j=0;j<k;j++)
                {
                    num z=a[i+j+k]*roots[j+k];
                    a[i+j+k]=a[i+j]-z;
                    a[i+j]=a[i+j]+z;
                }
            }
        }
    }

    vector<num> fa,fb;

    vector<int> multiply(vector<int> &a, vector<int> &b)
    {
        int need=a.size()+b.size()-1;
        int nbase=0;
        while((1<<nbase)<need) nbase++;
        ensure_base(nbase);
        int sz=1<<nbase;
        if(sz>(int)fa.size()) fa.resize(sz);
        for(int i=0;i<sz;i++)
        {
            int x=(i<(int)a.size()?a[i]:0);
            int y=(i<(int)b.size()?b[i]:0);
            fa[i]=num(x,y);
        }
        fft(fa,sz);
        num r(0,-0.25/sz);
        for(int i=0;i<=(sz>>1);i++)
        {
            int j=(sz-i)&(sz-1);
            num z=(fa[j]*fa[j]-conj(fa[i]*fa[i]))*r;
            if(i!=j) fa[j]=(fa[i]*fa[i]-conj(fa[j]*fa[j]))*r;
            fa[i]=z;
        }
        fft(fa,sz);
        vector<int> res(need);
        for(int i=0;i<need;i++) res[i]=fa[i].x+0.5;
        return res;
    }

    vector<int> multiply_mod(vector<int> &a,vector<int> &b,int m,int eq=0)
    {
        int need=a.size()+b.size()-1;
        int nbase=0;
        while((1<<nbase)<need) nbase++;
        ensure_base(nbase);
        int sz=1<<nbase;
        if(sz>(int)fa.size()) fa.resize(sz);
        for(int i=0;i<(int)a.size();i++)
        {
            int x=(a[i]%m+m)%m;
            fa[i]=num(x&((1<<15)-1),x>>15);
        }
        fill(fa.begin()+a.size(),fa.begin()+sz,num{0,0});
        fft(fa,sz);
        if(sz>(int)fb.size()) fb.resize(sz);
        if(eq) copy(fa.begin(),fa.begin()+sz,fb.begin());
        else
        {
            for(int i=0;i<(int)b.size();i++)
            {
                int x=(b[i]%m+m)%m;
                fb[i]=num(x&((1<<15)-1),x>>15);
            }
            fill(fb.begin()+b.size(),fb.begin()+sz,num{0,0});
            fft(fb,sz);
        }
        double ratio=0.25/sz;
        num r2(0,-1),r3(ratio,0),r4(0,-ratio),r5(0,1);
        for(int i=0;i<=(sz>>1);i++)
        {
            int j=(sz-i)&(sz-1);
            num a1=(fa[i]+conj(fa[j]));
            num a2=(fa[i]-conj(fa[j]))*r2;
            num b1=(fb[i]+conj(fb[j]))*r3;
            num b2=(fb[i]-conj(fb[j]))*r4;
            if(i!=j)
            {
                num c1=(fa[j]+conj(fa[i]));
                num c2=(fa[j]-conj(fa[i]))*r2;
                num d1=(fb[j]+conj(fb[i]))*r3;
                num d2=(fb[j]-conj(fb[i]))*r4;
                fa[i]=c1*d1+c2*d2*r5;
                fb[i]=c1*d2+c2*d1;
            }
            fa[j]=a1*b1+a2*b2*r5;
            fb[j]=a1*b2+a2*b1;
        }
        fft(fa,sz);fft(fb,sz);
        vector<int> res(need);
        for(int i=0;i<need;i++)
        {
            ll aa=fa[i].x+0.5;
            ll bb=fb[i].x+0.5;
            ll cc=fa[i].y+0.5;
            res[i]=(aa+((bb%m)<<15)+((cc%m)<<30))%m;
        }
        return res;
    }
    vector<int> square_mod(vector<int> &a,int m)
    {
        return multiply_mod(a,a,m,1);
    }
};
vector<int> v;
int main()
{
    scanf("%d%d",&n,&k);
    v.resize(10,0);
    for(int i=0;i<k;i++)
    {
        int x;
        scanf("%d",&x);
        v[x]=1;
    }
    vector<int> ans;
    ans.push_back(1);
    int p=n/2;
    while(p)
    {
        if(p&1) ans=fft::multiply_mod(ans,v,MOD);
        p>>=1;
        if(!p)break;
        v=fft::square_mod(v,MOD);
    }
    int res=0;
    for(auto t:ans) res=(res+1LL*t*t)%MOD;
    printf("%d\n",res);
    return 0;
}
#include<bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000
#define MOD 998244353
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,k;
const double PI=acos(-1.0);
namespace fft
{
    struct num
    {
        double x,y;
        num() {x=y=0;}
        num(double x,double y):x(x),y(y){}
    };
    inline num operator+(num a,num b) {return num(a.x+b.x,a.y+b.y);}
    inline num operator-(num a,num b) {return num(a.x-b.x,a.y-b.y);}
    inline num operator*(num a,num b) {return num(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
    inline num conj(num a) {return num(a.x,-a.y);}

    int base=1;
    vector<num> roots={{0,0},{1,0}};
    vector<int> rev={0,1};
    const double PI=acosl(-1.0);

    void ensure_base(int nbase)
    {
        if(nbase<=base) return;
        rev.resize(1<<nbase);
        for(int i=0;i<(1<<nbase);i++)
            rev[i]=(rev[i>>1]>>1)+((i&1)<<(nbase-1));
        roots.resize(1<<nbase);
        while(base<nbase)
        {
            double angle=2*PI/(1<<(base+1));
            for(int i=1<<(base-1);i<(1<<base);i++)
            {
                roots[i<<1]=roots[i];
                double angle_i=angle*(2*i+1-(1<<base));
                roots[(i<<1)+1]=num(cos(angle_i),sin(angle_i));
            }
            base++;
        }
    }

    void fft(vector<num> &a,int n=-1)
    {
        if(n==-1) n=a.size();
        assert((n&(n-1))==0);
        int zeros=__builtin_ctz(n);
        ensure_base(zeros);
        int shift=base-zeros;
        for(int i=0;i<n;i++)
            if(i<(rev[i]>>shift))
                swap(a[i],a[rev[i]>>shift]);
        for(int k=1;k<n;k<<=1)
        {
            for(int i=0;i<n;i+=2*k)
            {
                for(int j=0;j<k;j++)
                {
                    num z=a[i+j+k]*roots[j+k];
                    a[i+j+k]=a[i+j]-z;
                    a[i+j]=a[i+j]+z;
                }
            }
        }
    }

    vector<num> fa,fb;

    vector<int> multiply(vector<int> &a, vector<int> &b)
    {
        int need=a.size()+b.size()-1;
        int nbase=0;
        while((1<<nbase)<need) nbase++;
        ensure_base(nbase);
        int sz=1<<nbase;
        if(sz>(int)fa.size()) fa.resize(sz);
        for(int i=0;i<sz;i++)
        {
            int x=(i<(int)a.size()?a[i]:0);
            int y=(i<(int)b.size()?b[i]:0);
            fa[i]=num(x,y);
        }
        fft(fa,sz);
        num r(0,-0.25/sz);
        for(int i=0;i<=(sz>>1);i++)
        {
            int j=(sz-i)&(sz-1);
            num z=(fa[j]*fa[j]-conj(fa[i]*fa[i]))*r;
            if(i!=j) fa[j]=(fa[i]*fa[i]-conj(fa[j]*fa[j]))*r;
            fa[i]=z;
        }
        fft(fa,sz);
        vector<int> res(need);
        for(int i=0;i<need;i++) res[i]=fa[i].x+0.5;
        return res;
    }

    vector<int> multiply_mod(vector<int> &a,vector<int> &b,int m,int eq=0)
    {
        int need=a.size()+b.size()-1;
        int nbase=0;
        while((1<<nbase)<need) nbase++;
        ensure_base(nbase);
        int sz=1<<nbase;
        if(sz>(int)fa.size()) fa.resize(sz);
        for(int i=0;i<(int)a.size();i++)
        {
            int x=(a[i]%m+m)%m;
            fa[i]=num(x&((1<<15)-1),x>>15);
        }
        fill(fa.begin()+a.size(),fa.begin()+sz,num{0,0});
        fft(fa,sz);
        if(sz>(int)fb.size()) fb.resize(sz);
        if(eq) copy(fa.begin(),fa.begin()+sz,fb.begin());
        else
        {
            for(int i=0;i<(int)b.size();i++)
            {
                int x=(b[i]%m+m)%m;
                fb[i]=num(x&((1<<15)-1),x>>15);
            }
            fill(fb.begin()+b.size(),fb.begin()+sz,num{0,0});
            fft(fb,sz);
        }
        double ratio=0.25/sz;
        num r2(0,-1),r3(ratio,0),r4(0,-ratio),r5(0,1);
        for(int i=0;i<=(sz>>1);i++)
        {
            int j=(sz-i)&(sz-1);
            num a1=(fa[i]+conj(fa[j]));
            num a2=(fa[i]-conj(fa[j]))*r2;
            num b1=(fb[i]+conj(fb[j]))*r3;
            num b2=(fb[i]-conj(fb[j]))*r4;
            if(i!=j)
            {
                num c1=(fa[j]+conj(fa[i]));
                num c2=(fa[j]-conj(fa[i]))*r2;
                num d1=(fb[j]+conj(fb[i]))*r3;
                num d2=(fb[j]-conj(fb[i]))*r4;
                fa[i]=c1*d1+c2*d2*r5;
                fb[i]=c1*d2+c2*d1;
            }
            fa[j]=a1*b1+a2*b2*r5;
            fb[j]=a1*b2+a2*b1;
        }
        fft(fa,sz);fft(fb,sz);
        vector<int> res(need);
        for(int i=0;i<need;i++)
        {
            ll aa=fa[i].x+0.5;
            ll bb=fb[i].x+0.5;
            ll cc=fa[i].y+0.5;
            res[i]=(aa+((bb%m)<<15)+((cc%m)<<30))%m;
        }
        return res;
    }
    vector<int> square_mod(vector<int> &a,int m)
    {
        return multiply_mod(a,a,m,1);
    }
};
vector<int> v;
int main()
{
    scanf("%d%d",&n,&k);
    v.resize(10,0);
    for(int i=0;i<k;i++)
    {
        int x;
        scanf("%d",&x);
        v[x]=1;
    }
    vector<int> ans;
    ans.push_back(1);
    int p=n/2;
    while(p)
    {
        if(p&1) ans=fft::multiply_mod(ans,v,MOD);
        p>>=1;
        if(!p)break;
        v=fft::square_mod(v,MOD);
    }
    int res=0;
    for(auto t:ans) res=(res+1LL*t*t)%MOD;
    printf("%d\n",res);
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define re register int
#define F(x,y,z) for(re x=y;x<=z;x++)
#define FOR(x,y,z) for(re x=y;x>=z;x--)
typedef long long ll;
#define I inline void
#define IN inline int
#define C(x,y) memset(x,y,sizeof(x))
#define STS system("pause")
template<class D>I read(D &res){
	res=0;register D g=1;register char ch=getchar();
	while(!isdigit(ch)){
		if(ch=='-')g=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		res=(res<<3)+(res<<1)+(ch^48);
		ch=getchar();
	}
	res*=g;
}
const int Mod=998244353,N=(1<<22)+10;
int r[N];
IN Pow(int x,int y=Mod-2){
	re res=1;
	while(y){
		if(y&1)res=(ll)res*x%Mod;
		x=(ll)x*x%Mod;
		y>>=1;
	}
	return res;
}
I add(int &x,int y){(x+=y)>=Mod?x-=Mod:0;}
IN Plus(int x,int y){(x+=y)>=Mod?x-=Mod:0;return x;}
I ntt(int *f,int S,int sn){
	F(i,0,S-1)if(i<r[i])swap(f[i],f[r[i]]);
	for(re i=1;i<S;i<<=1){
		re gn=Pow(3,(Mod-1)/(i<<1));if(sn==-1)gn=Pow(gn);
		for(re p=i<<1,j=0;j<S;j+=p){
			re g0=1;
			for(re k=0;k<i;k++,g0=(ll)g0*gn%Mod){
				re X=f[j+k],Y=(ll)g0*f[i+j+k]%Mod;
				f[j+k]=Plus(X,Y);f[i+j+k]=Plus(X,Mod-Y);
			}
		}
	}
	if(sn==-1){
		re invn=Pow(S);
		F(i,0,S-1)f[i]=(ll)f[i]*invn%Mod;
	}
}
I mul(int lena,int *a,int lenb,int *b,int lenc,int *c){
	static int f[N],g[N];
	re lim=1,len=0;
	while(lim<(lena+lenb))lim<<=1,len++;
	F(i,0,lim-1)r[i]=(r[i>>1]>>1)|((i&1)<<(len-1));
	F(i,0,lim-1)f[i]=g[i]=0;
	F(i,0,lena-1)f[i]=a[i];F(i,0,lenb-1)g[i]=b[i];
	ntt(f,lim,1);ntt(g,lim,1);F(i,0,lim-1)f[i]=(ll)f[i]*g[i]%Mod;
	ntt(f,lim,-1);F(i,0,lenc-1)c[i]=f[i];F(i,lenc,lim-1)c[i]=0;
}
int n,m,k,W,ans,a[N],b[N],la,lb;
int main(){
	read(n);read(k);n>>=1;
	F(i,1,k)read(W),a[W]=1;
	b[0]=1;la=10;lb=1;
	while(n){
		if(n&1)mul(la,a,lb,b,la+lb,b),lb+=la;
		mul(la,a,la,a,la<<1,a),la<<=1;
		n>>=1;
	}
//	cout<<lb<<endl;
	F(i,0,lb-1)add(ans,(ll)b[i]*b[i]%Mod);
	printf("%d",ans);
	return 0;
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long
#define ll long long
#define vi vector <int>
#define vii vector <pair<int,int> >
#define rep(i,a,b) for (int i=a;i<b;i++)
#define repD(i,a,b) for (int i=a;i>b;i--)
#define pb push_back
#define pii pair <int,int>
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define MOD 1000000007
//#define PI 3.14159265359
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define deb(...) {...}
#ifndef local
	#define deb(...) ;
#endif

///----------------------------------------------------------------------------------

int n,k;
const int mod = 998244353;     /// prime
const int root = 565042129;          /// root^n = 1 mod prime
const int root_1 = 950391366;  /// root inverse
const int root_pw = 1 << 20; /// n (max degree of polynomial)

/*inline int add(int A, int B)
{
	if (A+B>=mod)return A+B-mod;
	return A+B;
}

inline int mul(int A, int B)
{
	if (A*B<mod)return A*B;
	return (A*B)%mod;
}*/
int expo(int x,int y,int mod)
{
    int res=1;
    while(y>0)
    {
        if (y&1)res=mul(res,x);
        y/=2;x=mul(x,x);
    }
    return res;
}
void fft(vector<int> & a, bool invert) {
    int n = a.size();

    for (int i = 1, j = 0; i < n; i++) {
        int bit = n >> 1;
        for (; j & bit; bit >>= 1)
            j ^= bit;
        j ^= bit;

        if (i < j)
            swap(a[i], a[j]);
    }

    for (int len = 2; len <= n; len <<= 1) {
        int wlen = invert ? root_1 : root;
        for (int i = len; i < root_pw; i <<= 1)
            wlen = mul(wlen,wlen);

        for (int i = 0; i < n; i += len) {
            int w = 1;
            for (int j = 0; j < len / 2; j++) {
                int u = a[i+j],
                v = mul(a[i+j+len/2] , w);
                a[i+j] = u + v < mod ? u + v : u + v - mod;
                a[i+j+len/2] = u - v >= 0 ? u - v : u - v + mod;
                w=mul(w,wlen);
            }
        }
    }

    if (invert) {
        int n_1 = expo(n, mod-2, mod);
        for (int & x : a)
            x=mul(x,n_1);
    }
}

vector<int> mul(const vector<int> &a,const vector<int> &b)
{
    vector<int> fa(a.begin(), a.end()),fb(b.begin(), b.end());
    int n=1;
    while(n<a.size()+b.size())
        n<<=1;

    fa.resize(n);fb.resize(n);
    fft(fa,0);
    fft(fb,0);

    for(int i=0;i<n;i++)
        fa[i]=mul(fa[i],fb[i]);
    fft(fa,1);
    vector<int> res;
    for(int i=0;i<n;i++)
        res.push_back(fa[i]);
    res.resize(a.size()+b.size()-1);
    return res;
}

vector<int> expo(vector<int> A,int y)
{
    vector<int> res={1};
    while(y>0)
    {
        if (y&1)res = mul(res,A);
        y/=2;
        A=mul(A,A);
    }
    return res;
}

void solve()
{
	cin>>n>>k;
	vi A(10,0);
	while(k--)
	{
		int temp;cin>>temp;A[temp]++;
	}

	A=expo(A,n/2);
	int ans=0;
	for (auto x:A)ans=add(ans,mul(x,x));
	cout<<ans<<"\n";

}
signed main()
{
	ios_base::sync_with_stdio(false);cin.tie(NULL);

 	#ifdef local
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    clock_t qwertyuiop = clock();
    #endif

 	int t=1;
    //cin>>t;

    rep(a,0,t)
    {
        ///cout<<"Case #"<<a+1<<": ";
        solve();
	}

    #ifdef local
    {qwertyuiop = clock() - qwertyuiop;double time_taken = ((double)qwertyuiop)/CLOCKS_PER_SEC;cerr<<fixed<<setprecision(5)<<"\n\nTime Taken : "<<time_taken<<" seconds\n";}
	#endif
}


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#define fi first
#define se second
#define ll long long
#define ld long double
#define all(x)              (x).begin(), (x).end()
#define inf                 1e18

using namespace std;
using namespace __gnu_pbds;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll mod = 998244353;
const ll root = 15311432;
const ll rootI = 469870224;
const ll pw = 1 << 23;

ll w[2][pw];

ll bp(ll a, ll n) {
        ll res = 1;
        while (n) {
                if (n & 1) res *= a, res %= mod;
                a *= a, a %= mod;
                n >>= 1;
        }
        return res;
}

inline ll mul(ll a, ll b) { return ((a * b) % mod); }

inline void fft(vector <ll> &ar, bool inv) {
        if (ar.size() == 1) return;

        int n = ar.size();
        for (int i = 1, j = 0; i < n; i++) {
                int bit = n >> 1;
                for (; j & bit; bit >>= 1)
                        j ^= bit;
                j ^= bit;
                if (i < j) swap(ar[i], ar[j]);
        }

        for (int len = 2; len <= n; len <<= 1) {
                int step = pw / len - 1;
                for (int i = 0; i < n; i += len) {
                        ll w = 1;
                        for (int j = 0; j < len / 2; ++j) {
                                ll a = ar[i + j], b = mul(ar[i + j + (len / 2)], w[inv][j * step]);
                                ar[i + j] = ((a + b < mod) ? (a + b) : (a + b - mod));
                                ar[i + j + (len / 2)] = ((a - b >= 0) ? (a - b) : (a - b + mod));
                        }
                }
        }
        if (inv) {
                ll cur = bp(n, mod - 2);
                for (auto &i : ar) i = mul(i, cur);
        }
}

inline ll get(ll a) {
        if (a == 1 || !(a & (a - 1))) return a;
        return (1LL << (64 - __builtin_clzll(a - 1)));
}

inline void mult(vector <ll> &a, vector <ll> b) {
        int sz = 2 * max(get(a.size()), get(b.size()));
        while (a.size() < sz) a.push_back(0);
        while (b.size() < sz) b.push_back(0);

        fft(a, 0); fft(b, 0);
        for (int i = 0; i < a.size(); ++i) a[i] = mul(a[i], b[i]);

        fft(a, 1);
        while (a.back() == 0) a.pop_back();
}

void solve() {
        int n, k;
        cin >> n >> k;
        vector <ll> ar(10);
        for (int i = 0; i < k; ++i) {
                int x;
                cin >> x; ar[x] = 1;
        }

        w[0][0] = 1; w[1][0] = 1;
        for (int i = 1; i < pw; ++i) {
                w[0][i] = mul(w[0][i - 1], root);
                w[1][i] = mul(w[1][i - 1], rootI);
        }

        n >>= 1;
        vector <ll> res(10); res[0] = 1;
        while (n) {
                if (n & 1) mult(res, ar);
                mult(ar, ar);
                n >>= 1;
        }

        ll ans = 0; swap(ar, res);
        for (int i = 0; i < ar.size(); ++i) {
                ans += mul(ar[i], ar[i]);
                if (ans >= mod) ans -= mod;
        }
        cout << ans;
}

int main() {
        ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//      freopen("input.txt", "r", stdin);
//      freopen("output.txt", "w", stdout);
        int q = 1; // cin >> q;
        while (q--) {
                solve();
        }
}


#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

long long sum(long long n)
{
     long long res=0;
     while (n>0)
     {
           res+=n%10;
           n/=10;
     }
     return res;
}

int main()
{
	long long n,x,d,b,y;
	cin >> n;
	x = -1;
	for(b = 1; b < 91; b++)
	{
		d = long(sqrt(b * b - 4* n);
		y = (d - b) / 2;
		if ( sum(y) == b)
		{
			x = y;
			break;
		}
	}
	cout << x;
	return 0;
}


//x(x + s(x)) = n

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long long int64;

const int64 oo = 1LL << 60;

int64 sLen(int64 n) {
    int64 res = 0;
    while (n) {
        res += n % 10;
        n /= 10;
    }
    return res;
}

int main() {
    long long n; cin >> n;

    int64 ans = oo;
    for (int i = 0; i <= 90; i++) {
        int b = i;
        // x^2 + s(x) * x = n
        int del = b * b - 4 * 1 * (-n);
        if (del < 0) continue;
        else {
            int64 t = (int64)sqrt((double) del);
            if (t * t == del) {
                int64 x1 = (-b + t) / 2;
                int64 x2 = (-b - t) / 2;
                if (x1 > 0 && sLen(x1) == i) {
                        ans = min <int64> (ans, x1);
                }
                if (x2 > 0 && sLen(x2) == i) {
                    ans = min <int64> (ans, x2);
                }
            }
        }
    }
    if (ans == oo) cout << -1 << endl;
    else cout << ans << endl;

    return 0;
}


#include <iostream>

using namespace std;
long long n;
long long check(long long m)
{
    long long sum = 0, k, cp;
    cp = m;
    while (m)
    {
        k = m % 10;
        sum += k;
        m /= 10;
    }
    return (cp * cp + sum * cp - n);
}

int main()
{
    long long l, r, m, kk;
    cin >> n;
    l = 0;
    r = 10000000000.0;
 if (n < 1000000)
  for(long long i = 0; i < 20000; i++)
  {
   if (check(i) == 0)
   {
    cout << i;
    return 0;
   }
  }
 else {
    while (l <= r)
    {
        m = l + (r - l)/2 +1;
        kk = check(m);
        if (kk < 0)
            l = m + 1;
        else if (kk > 0)
            r = m;
        else if (!kk)
        {
            cout << m;
            return 0;
        }
        //cout <<l << " "<<r <<" "<< check(m) << endl;
    }
 //}
    cout << -1;
    return 0;
}


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

/* MIGHT BE OF USE

#define si(x)	scanf("%d",&x)
#define pi(x)	printf("%d\n",x)

typedef pair<int, int>	pii;
typedef vector<int>		vi;
typedef vector<pii>		vpii;
*/

#define fo(i,a,b) for(i=a;i<b;i++)
#define ll long long
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define sl(x)	scanf("%lld",&x)
#define pl(x)	printf("%lld\n",x)
#define ss(s)	cin>>s
#define ps(s)	cout<<s
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back

typedef pair<ll, ll>	pl;
typedef vector<ll>		vl;
typedef vector<pl>		vpl;
typedef vector<string>	vs;

ll gcd(ll a, ll b)
{
    if(b==0)
        return a;
    a%=b;
    return gcd(b,a);
}

ll sod (ll num)
{
    ll sum=0;
    while(num)
    {
        sum += num%10;
        num /= 10;
    }
    return sum;
}

void solve()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    ll i, j, n, m;
    cin>>n;
    i = n/2;
    ll lowerLimit = sqrt(i);

    ll upperLimit = sqrt(n);

    x=upperLimit;

    while(((x*x) + (sod(x)*x) != n)&&(x>=lowerLimit))
        x--;

    if((x*x) + (sod(x)*x) != n)
        cout<<-1;
    else
        cout<<x;

}

int main()
{

    ll t = 1;
    //sl(t);
    while(t--)
    {
        solve();
    }

    return 0;
}


#include<iostream>
#include<vector>
#include<algorithm>
int main(){
    int n;
    cin>>n;
    vector<int> a;
    int m;
    for(int i=0;i<n;i++){
        cin>>m;
        a.push_back(m);
    }
    sort(a.begin,a.end());

     for(int i=0;i<n;i++){

        cout<<a[i];
    }

}


#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <time.h>
#include <vector>

#if LOCAL
	#define DO_NOT_SEND
#endif

typedef long long LL;

int IntMaxVal = (int) 1e20;
int IntMinVal = (int) -1e20;
LL LongMaxVal = (LL) 1e20;
LL LongMinVal = (LL) -1e20;

#define FOR(i, a, b) for(int i = a; i < b ; ++i)
#define FORD(i, a, b) for(int i = a; i >= b; --i)

#define minimize(a, b) { a = min(a, b); }
#define maximize(a, b) { a = max(a, b); }

#define all(v) v.begin(),v.end()

using namespace std;

#define next(type, i) type i; cin >> i;
template<typename T> struct argument_type;
template<typename T, typename U> struct argument_type<T(U)> { typedef U type; };
#define nextVector(t, v, size) vector< argument_type<void(t)>::type > v(size); { for (int i = 0 ; i < size ; i++) cin >> v[i]; }

template <typename T1, typename T2>
istream& operator >>(istream& is, pair<T1, T2>& s)
{
    is >> s.first >> s.second;
    return is;
}

int main() {
	srand (time(NULL));
    ios_base::sync_with_stdio(false);

    next(int, n);
	nextVector(int, a, n);

	sort(all(a));
	for (auto x : a) cout << a << ' ';
}


#include <iostream>
using namespace std;

int main() {
	int n,ele;
	cin>>n;
	int arr[n-1];
	for(int i=0;i<n;i++)
	{
		cin>>ele;
		arr[i]=ele;
	}
	sort(arr,arr+n);
	for(int i=0;i<n;i++)
		{
			cout<<arr[i]<<" ";
		}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, temp=0;cin>>n;
    while(n--){
        int a[n];cin<<a[n];
        temp=a;
        for(int i=1 ;i<a.length();i++ ){
            if temp>a[i];
            temp=a[i];
            s+=temp +" ";
        }
    }
    cout<<s<<endl;
    return 0;
}


bool test(int row, int col)
{
	int x = row;
	int y = col;
	int xLimit = x + 2;
	int yLimit = y + 2;
	int win = 0;
	int dot = 0;
	for (;x < xLimit; x++)
	{
		for (y = col; y < yLimit; y++)
		{
			if (numbers[x][y] == 1)
				win++;
		}
	}
	if (win == 2)
		return false;
	return true;
}
void main()
{
	char cha;
	int win = 0;
	int dot = 0;
	string yes = "YES";
	string no = "NO";
	for (int i = 0; i < 4; i++)
	{
		for (int j = 0; j < 4; j++)
		{
			cin >> cha;
			if (cha == '#')
				numbers[i][j] = 1;
			else
				numbers[i][j] = 0;
		}
	}
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			if (test(i, j))
			{
				cout << yes;
				return;
			}
		}
	}
	cout << no;

}


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define DrSlidez ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define Files freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define pi 3.14159265
#define mod 1000000007
#define pb push_back
#define INF LONG_LONG_MAX
#define sz 105

int cnt, m = 4, n = 4,
qurater[4][3][2] = { {-1, -1}, {-1, 0}, {0, -1},
 					{0, -1}, {1, -1}, {1, 0},
					{-1, 0}, {-1, 1}, {0, 1},
					{0, 1}, {1, 0}, {1, 1} };

bool val(int x, int y)
{
	return ((x > -1) && (x < m) &&
		(y > -1) && (y < n));
}

int main()
{
	DrSlidez
	char arr[4][4];
	for (int i = 0; i < 4; i++)
		for (int j = 0; j < 4; j++)
			cin >> arr[i][j];

	for (int i = 0; i < 4; i++)
	{
		for (int j = 0; j < 4; j++)
		{
			for (int k = 0; k < 4; k++)
			{
				cnt = 0;
				for	(int h = 0; h < 3; h++)
					if (val(i + sur[k][h][0], j + sur[k][h][1]) && arr[i + sur[k][h][0]][j + sur[k][h][1]] == '#')
						cnt++;
				if (cnt >= 3)
					return cout << "YES", 0;
			}
		}
	}
	cout << "NO";
	return 0;
}


#include＜stdio.h＞
int main（）
｛
char[4][4];
while（scanf（＂%s＂,a[0]）！=EOF）
｛
scanf（＂%s%s%s＂，a[1]，a[1]，a[2]）；
int i，p=0；
for（i=0；i＜=2；i++）
｛
for（int j=0；j＜=2；j++）
｛
if（a[i][j]==a[i][j+1]&&（a[i][j]==a[i+1][j]||a[i][j]===a[i+1][j+1])；
｛printf（"YES\n＂）；p=1；break；
｝
if（a[i][j+1]==a[i+1]&&a[i][j+1]==a[i+1][j+1]）
｛printf（"YES\n）；p=1；break
；
｝
｝
if（p==1)
break；
｝
}
if（p==0)
printf("NO\n")；
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int n,t,sum=0;
    cin>>n;
    bool f=true;
    string str;
    while(n--)
    {
        cin>>t>>str;
        if(str[0]=='N')sum-=t;
        else if(str[0]=='S')sum+=t;
        if((sum<0||sum>20000)||(sum==20000&&str[i]!='N'))f=false;
        cout<<sum<<endl;
    }
    if(f&&sum==0)cout<<"YES";
    else cout<<"NO";
}


#include<stdio.h>
#include<string.h>
char n[1000];
int i,j,k;
int N=0,S=0;
int leght=0;
bool check1=1,check2=1;
int main()
{
    scanf("%d",&k);
    for(i=1;i<=k;i++)
    {

        scanf("%d%s",&j,n);
        if(leght%40000==20000) if(n[0]!='N') {check1=0;}
        if(leght%40000==0) if(n[0]!='S') {check2=0;}
        if(n[0]=='N') leght-=j;
        if(n[0]=='S') leght+=j;
    }
    if(leght==0&&check1==1&&check2==1;) printf("YES");
    else printf("NO");

}


#include <iostream>

using namespace std;

int main()
{
    int n ,tmp, vertical ,position;
    string dir;
    for(int i=0;i<n;i++){
            cin>>tmp;
            cin>>dir;
            switch(dir){
                case "South" :position = position+ dir;
                            break;
                case "North" : position = position- dir;
                            break;
            }
            if(position>4000 ||position<0){
                    cout<<"NO";
                break;
            }
    }
    cout<<"YES"
    cout << "Hello world!" << endl;
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

int n, m, a;
string s;

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for(int i = 0 ; i < n ; ++ i) {
    cin >> m >> s;
    if(a == 0 && s[0] != 'S') {
      cout << "NO" << endl;
      return 0;
    }
    if(a == 20000 && s[0] != 'N') {
      cout << "NO" << endl;
      return 0;
    }
    if(s[0] == 'N')
      a -= m;
    else
      if(s[0] == 'S')
    	a += m;
    }
    if(a > 20000 && a < 0) {
      cout << "NO" << endl;
      return 0;
    }

  }
  if(!a)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}


#include <iostream>
using namespace std;
int main() {
   int i,b[105],t;
   char a[105];
   t=0; cin>>a;
   for (i=0;(int)a[i]>0;i++){
b[i]=int(a[i])-96;
}
   b[i]=0; for (i=0;a[i+1]>0;i++){
       if (abs(b[i]-b[i+1])<13){
           t=t+abs(b[i]-b[i+1]);
       }
       else{ t=t+(26-abs(b[i]-b[i+1]));
}
}
   if (abs(b[0]-1)<13){ t=t+abs(b[0]-1);
}
   else{ t=t+(26-abs(b[0]-1));
}
cout<<t<<endl; return 0;
}


#include<bits/stdc++.h>
using namespace std;
char s[105];
int a;
int main(){
  scanf("%s",s);
  char it ='a';
  int  n  =strlen(s);
  for(int i=0 ; i<n ;i++){
  a+=min(abs(26-abs(s[i]-it),s[i]-it));
  it=s[i];
  }
  printf("%d\n",a);
}


#include<iostream>
using namespace std;
int main()
{
	char c, p = 'a';
	int i = 0;
	while(cin >> c)
	{
	    i += min(abs(p-c), 26-abs(p-c));
	    p=c;

	}
	cout << r;
	return 0;
}


        #include<iostream>
        #include <cstdlib>
        #include <algorithm>
        using namespace std;

        int main(){
            string str;
            cin>>str;
            int total =0;
            for(int i =0;i<str.length()-1;i++)
            {
                total+= min(abs(str[i]-str[i+1]),abs(str[i+1],str[i]));
            }
            cout<<total;
            return 0;
        }


#include<bits/stdc++.h>
int main(){
    int n,s;
    s=0;
    cin>>n;
    while(n)
    {
        if(n%8==1)
            s++;
        n/=8;
    }
    cout<<s;
}


#include<bits/stdc++.h>
int a,ans;
int main()
{
    cin>>a;
    while(a!=0)
    {
        if(a%8==1) ans++;
        a/=8;
    }
    cin>>ans;
}


#include <iostream>
using namespace std;
int a , cnt=0;
int main()
{
    cin >> a;
    while(a != 0)
    {
        if(a % 8 == 1)
        {
        	cnt++;
		}
        a /= 8;
    }
    cout<<sum<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl;
}


#include<iostream>
#include<string.h>
using namespace std;
int main()
{
   int t;
   cin>>t;
   while(t--)
   {
       int x,result=0;
       cin>>x;
       if(x>=2&&x<=7)
        cout<<"1"<<endl;
       else if(x>7)
       {
           int k=0;
           k=x%5;
           if(k==1)
           {
               result=(x/4)+1;

           }
             else
             {
                 result=(x/5)+1;
             }
                   cout<<result<<endl;s
       }

   }
 return 0;
}


#include<iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        cout<<n/7+*(n%7!=0)<<"\n";
    }
}


#include <map>
#include <string>
#include <vector>
#include <set>
using namespace std;
vector <int> ans;
int main() {
	int n;
	int a;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a;
		if (a % 6 == 0) cout << a / 6 << endl;
		else cout << a / 6 + 1 << endl;
	}
	system("pause");
	return 0;
}


    #include<iostream>
    using nsmespace std;
    int main()
    {
        int n,*num;
        cin>>n;
        num=new int[n];
        for(int i=0;i<n;i++)
        {
            cin>>num[i];
            cout<<num[i]/2<<endl;
        }
    }


#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int step[105]={0},t=0,n,m;
int ex,ey,sx,sy,ans=0;
char map[55][55]={0};
int change[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
    scanf("%d%d",&n,&m);
    char c=getchar();
    for(int i=0;i<n;i++){
        while(c!='.'&&c!='#'&&c!='S'&&c!='E')c=getchar();
        for(int j=0;j<m;j++){
            map[i][j]=c;
            if(c=='S')
                sx=i,sy=j;
            else if(c=='E')
                ex=i,ey=j;
            c=getchar();
        }
    }
    while(c>'3'||c<'0') c=getchar();
    while(c>='0'&&c<='3'){
        step[t]=c-'0';
        c=getchar();
        t++;
    }
}

void walk(int x,int y,int z,int w){
    int r=sx,c=sy,a[4]={x,y,z,w};
    for(int i=0;i<t;i++){
        r=r+change[a[step[i]]][0];
        c=c+change[a[step[i]]][1];
        if(r<0||c<0||r>=n||c>=m||map[r][c]=='#')
            return;
        if(r==ex&&c==ey){
            ans++;
            return;
        }
    }
    return;
}
void solve(){
    for(int i=0;i<4;i++){
        for(int j=0;j<4;j++){
            if(i==j) continue;
            for(int k=0;k<4;k++){
                if(k==j||k==i) continue;
                for(int l=0;l<4;l++){
                    if(i==l||k==l||j==l) continue;
                    walk(i,j,k,l);
                }
            }
        }
    }
}
int main(){
    Init();
    solve();
    printf("%d",ans);
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
char op[10];int num[10];
ll ans = 0x7fffffffffffffff;
vector<ll>k;
void dfs(vector<ll>a,int now){
    if(now == 4) {
		ans = min(ans , a[0]);
		return ;
	}vector<int>b=a;
	for(int i = 0; i < a.size(); i++) {
        for(int j = i + 1; j < a.size(); j++) {
            if(op[now] == '+')a[i] = a[i] + a[j];
            if(op[now] == '*')a[i] = a[i] * a[j];
            a.erase(a.begin() + j);
            dfs(a , now + 1);
            a = b;
        }
    }
}
signed main() {
    int t;
	for(int i = 1; i <= 4; i++)scanf("%lld" , &num[i]),k.push_back(num[i]);
	for(int i = 1 ; i <= 3; i++){
	    cin >> op[i] ;
	}
	dfs(k , 1);
	cout<<ans<<endl;
	return 0;
}


#include<string>
#include<string.h>
#include<map>
#include<set>
#include<vector>
#include<stdio.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<queue>
#define pi pair<int,int>
#define pii pair<pi,int>
#define mp make_pair
#define pb push_back
#define ll long long
using namespace std;
ll a[4],am;
char x,y,z;
int main()
{
  cin>>a[0]>>a[1]>>a[2]>>a[3]>>x>>y>>z;
  if(x=='*')am++;
  if(y=='*')am++;
  if(z=='*')am++;
  ll ans;
  sort(a,a+4);
  if(a[0]==0 and am)ans=0;
  else{
    if(am==3)ans=a[0]*a[1]*a[2]*a[3];
    if(am==2)if(a[0]*a[1]>a[3]){
      ans=a[0]*a[1]+a[2]*a[3];
      ans=min(a[0]*a[2]+a[1]*a[3]);
    }
    else ans=a[0]*a[1]*a[2]+a[3];
    if(am==1)ans=a[0]*a[1]+a[2]+a[3];
    if(!am)ans=a[0]+a[1]+a[2]+a[3];
  }
  cout<<ans;
  return 0;
}


/*
 * Test.cpp
 *
 *  Created on: 2017年7月1日
 *      Author: lenovo
 */

#include<iostream>
#include<algorithm>
using namespace std;

int main() {
    int a, b, l, r, c, pl, pr, cl, cr;
    cin >> a >> b >> l >> r;
    c = a + b;
    //判断下标是否在同一个AB组合内
    cl = --l / c;
    cr = --r / c;
    //获取AB分别对应的索引
    pl = l % c;
    pr = r % c;
    if (cl == cr) {
        if (pl < a && pr < a) {
            cout << pr - pl + 1 << endl;
        } else if (pl < a && pr >= a) {
            cout << a - pl << endl;
        } else {
            cout << 1 << endl;
        }
    } else if (a <= b) {
        if (cl < cr - 1) {
            cout << a + 1 << endl;
        } else {
            if (pr >= a) {
                cout << a + 1 << endl;
            } else {
                if (pl >= a) {
                    cout << pr + 1 + 1 << endl;
                } else {
                    int left = a - pl;
                    int right = pr + 1;
                    if (left + right > a) {
                        cout << a + (right == a) << endl;
                    } else {
                        cout << left + right + (right == a) << endl;
                    }
                }
            }

        }
    } else {
        int d = a - b;
        if (cl == cr - 1) {
            if (pr >= a && pl >= a) {
                cout << a + 1 << endl;
            } else if (pr < a && pl >= a) {
                cout << pr + 1 + 1 << endl;
            } else if (pr >= a && pl < a) {
                cout << min((a + a - pl), a + a - b) << endl;
            } else if (pr < a && pl < a) {
                if (pl > b) {
                    cout << pr + 1 + a - pl << endl;
                } else {
                    cout << ptr + 1 + a - b << endl;
                }
            }
//            else {
//                int right = min(pr + 1, a);
//                int left = max(1, min(a - b, a - pl));
//                cout << right + left << endl;
//            }

        } else if (cl == cr - 2) {
            cout << a + max(1, d + min(0, pr - a + 1 + max(0, a - pl)));
        } else {
            cout << a + d;
        }
    }

}


/*
 * Test.cpp
 *
 *  Created on: 2017年7月1日
 *      Author: lenovo
 */

#include<iostream>
#include<algorithm>
using namespace std;

int main() {
    int a, b, l, r, c, pl, pr, cl, cr;
    cin >> a >> b >> l >> r;
    c = a + b;
    //判断下标是否在同一个AB组合内
    cl = --l / c;
    cr = --r / c;
    //获取AB分别对应的索引
    pl = l % c;
    pr = r % c;
    if (cl == cr) {
        if(pl<a&&pr<a){
            cout<<pr-pl+1<<endl;
        }else if(pl<a&&pr>=a){
            cout<<a-pl<<endl;
        }else{
            cout<<1<<endl;
        }
    } else if (a <= b) {
        if (cl < cr - 1) {
            cout << a + 1;
        } else {
            if(pl<=a&&rl<=a){
                cout<<max(a-pl,a-pr)<<endl;
            }else if(pl<a&&rl>a){
                cout<<a+1<<endl;
            }else if(pl>a&&pr<a){
                cout<<pr+1<<endl;
            }else if(pl>a&&rl>a){
                cout<<a+1<<endl;
            }
        }
    }else{
        int d=a-b;
        if(cl==cr-1){
            cout<<max(1,min(d,a-pl))+min(a,pr+1);
        }else if(cl==cr-2){
            cout<<a+max(1,d+min(0,pr-a+1+max(0-a-pl)));
        }else{
            cout<<a+d;
        }
    }

}


#include<bits/stdc++.h>
using namespace std;
bool ans;
main()
{
	string s;
	int i,n;
	cin>>s>>n;
	string x[n];
	for(i=0;i<n;++i)
	{
		cin>>x[i];
		if(x[i]==s)ans=1;
	}
	for(i=0;i<n;++i)
	{
		for(j=0;j<n;++j)
		{
			if(i!=j&&x[i][0]==s[0]&&x[j][1]==s[1])ans=1;
		}
	}
	if(ans)cout<<"YES";
	else cout<<"NO";
}


#include <iostream>
using namespace std;
int main(){
    string password, a[100];
    int n;
    bool yes;
    cin>>password>>n;
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    for(int i=0; i<n; i++){
        if(password == a[i]){
            cout<<"YES";
            return 0;
        }
    }
    for(int i=0; i<n; i++){
        for(int u=0; u<n; u++){
            if(password[0] == a[u][1] && password[1] == a[i][0]){
                cout<<"YES";
                return 0;
            }
        }
    }
    cout<<"NO";
    return 0;
}


#include<iostream>
#include<string>
using namespace std;
int main()
{
	string pass, s;
	int n, x = 0, y = 0, z = 0;
	cin >> pass>>n;
	for (int i = 0; i < n; i++)
	{
		cin >> s;

		if (s == pass)
			x++;
		else if (pass[0] == s[1])
		y++;
		else if (pass[1] == s[0])
			z++;
	}
	if ((y>= 1 && z >= 1) || x >= 1)
		cout << "YES";
	else
		cout << "NO"

	return 0;
}


#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=3e8+7;
bool cnt[maxn];
bool isprime[maxn];
int sum[maxn];
void getprime(){
    memset(isprime,true,sizeof(isprime));
    for(int i=2;i<=sqrt(maxn);i++){
        if(isprime[i]){
            for(int j=i*i;j<maxn;j+=i)
                isprime[j]=false;
        }
    }
}

int main(){
    getprime();
    //for(int i=1;i<=20;i++) cout<<i<<" "<<isprime[i]<<endl;
    ll ans;
    //cout<<"*****"<<endl;
    for(int i=1;i<=sqrt(maxn);i++){
        for(int j=1;j<=sqrt(maxn);j++){
            ans=i*i+j*j;
            if(isprime[ans])cnt[ans]=1;
        }
    }
    for(int i=1;i<maxn;i++) sum[i]=sum[i-1]+cnt[i];
    int l,r;

    cin>>l>>r;
    cout<<sum[r]-sum[l-1]<<endl;
    return 0;
}


include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <bitset>
using namespace std;
const int Max=17500;
int prim[Max];
bitset<Max>vis;
bitset<300000000/4+10>sign;
void is_prim()
{
     vis[0]=vis[1]=1;
     register int num=0;
     for(register int i=2;i<=Max;i++)
     {
          if(!vis[i])
          {
            num++;
            prim[num]=i;
          }
          for(register int j=1;((j<=num)&&(i*prim[j]<=Max));j++)
          {
            vis[i*prim[j]]=1;
            if(i%prim[j]==0)
            break;
          }
     }
}
int num(int l,int r)
{
    int p=2014;
    for (register int i=2;i<=p+1&&prim[i]*prim[i]<=r;i++)
    {
        int cnt=l/prim[i];
        if (cnt*prim[i]<l) cnt++;
        if (cnt==1) cnt++;
        for (int j=cnt*prim[i];j<=r;j+=prim[i])
        if (j%4==1) sign[j>>2]=1;
    }
    int ans=0;
    for (register int j=l;j<=r;j+=4)
    if (j%2&&!sign[j>>2]) ans++;
    return ans;
}
int main()
{
    is_prim();
    int l,r;
    int ans=0;
    scanf("%d %d",&l,&r);
    if (l<=2&&r>=2) ans++;
    while(l%4!=1||l==1) l++;
    while(r%4!=1) r--;
    ans+=num(l,r);
    printf("%d\n",ans);
}


#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

#define CONFIG ios_base::sync_with_stdio(false);cout<<fixed;cout<<setprecision(10);
#define INF 2000000000ll
#define SIZE 100010ll
#define pb push_back
#define F first
#define S second

bitset<1000000001> d;

int32_t main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

}


//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")

#include <stdio.h>
#include <bits/stdc++.h>
typedef unsigned long long ull;
#define uint unsigned int
#define ll long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)

using namespace std;

inline void setmin(int &x, int y) { if (y < x) x = y; }
inline void setmax(int &x, int y) { if (y > x) x = y; }
inline void setmin(ll &x, ll y) { if (y < x) x = y; }
inline void setmax(ll &x, ll y) { if (y > x) x = y; }

const int N = 300000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const double eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

bool e[N];
vector<int> pr;

void init(int l, int r)
{
    if (sz(pr) == 0)
    {
        int x = 1;
        while ((x + 1) * (x + 1) <= 300000000)
            x++;
        fill(e, e + x + 1, true);
        e[0] = e[1] = false;
        for (int i = 2; i * i <= x; ++i)
            if (e[i])
            {
                for (int j = i * i; j <= x; j += i)
                    e[j] = false;
            }
        for (int i = 2; i <= x; ++i) {
            if (e[i]) {
                pr.push_back(i);
            }
        }
    }
    fill(e, e + (r - l + 1), true);
    if (l == 1)
        e[0] = false;
    for (int p : pr)
    {
        if (p > r)
            break;
        int x = (l + p - 1) / p * p;
        if (x == p)
            x += p;
        int pos = x - l;
        while (x <= r)
        {
            e[pos] = false;
            x += p;
            pos += p;
        }
    }
}

vector<int> cnt_good = {4784,8978,12981,16901,20732,24523,28249,31916,35585,39176,42818,46430,49962,53516,57023,60523,64040,67489,70985,74417,77879,81285,84679,88055,91433,94878,98240,101608,104979,108284,111653,115039,118375,121695,124997,128270,131626,134912,138219,141503,144830,148121,151368,154619,157925,161166,164444,167675,170946,174194,177433,180617,183844,187048,190283,193493,196709,199900,203111,206333,209526,212732,215966,219123,222272,225463,228651,231844,235069,238261,241443,244581,247733,250868,253974,257141,260352,263482,266623,269760,272885,276014,279149,282271,285396,288556,291710,294878,297984,301101,304177,307326,310444,313579,316642,319813,322904,326007,329106,332181,335268,338394,341465,344551,347665,350739,353840,356909,360000,363080,366160,369261,372328,375439,378518,381635,384728,387817,390920,393993,397033,400087,403209,406288,409309,412333,415431,418499,421556,424569,427583,430660,433680,436753,439791,442818,445857,448901,451962,454974,457972,461015,464069,467135,470153,473178,476215,479250,482265,485275,488279,491293,494311,497242,500236,503251,506276,509308,512383,515414,518404,521398,524428,527422,530472,533469,536442,539450,542467,545501,548499,551461,554513,557493,560489,563514,566514,569508,572481,575503,578464,581445,584484,587448,590416,593357,596373,599365,602379,605357,608340,611346,614316,617284,620283,623219,626204,629187,632137,635171,638124,641088,644018,646968,649933,652929,655897,658857,661819,664771,667743,670676,673688,676670,679672,682576,685541,688504,691478,694490,697405,700326,703273,706181,709115,712113,715038,717989,720960,723896,726882,729831,732782,735740,738676,741606,744563,747458,750384,753318,756217,759188,762199,765150,768087,771012,773928,776896,779827,782754,785698,788611,791513,794449,797361,800286,803241,806180,809116,812028,814963,817868,820796,823752,826720,829643,832596,835498,838436,841364,844292,847194,850080,853022,855895,858875,861761,864672,867592,870514,873482,876358,879282,882186,885138,888023,890933,893857,896758,899686,902573,905460,908421,911332,914214,917110,920007,922881,925822,928780,931678,934604,937520,940453,943326,946295,949181,952088,955026,957871,960726,963624,966507,969407,972309,975196,978085,980962,983867,986746,989647,992538,995405,998272,1001141,1004047,1006935,1009828,1012698,1015619,1018497,1021407,1024321,1027185,1030064,1032962,1035803,1038722,1041665,1044521,1047338,1050175,1053074,1055897,1058798,1061676,1064500,1067388,1070268,1073174,1076029,1078883,1081790,1084692,1087554,1090413,1093331,1096221,1099056,1101903,1104801,1107645,1110568,1113425,1116309,1119226,1122066,1124941,1127772,1130652,1133559,1136475,1139334,1142195,1145026,1147867,1150738,1153592,1156490,1159339,1162244,1165140,1168043,1170911,1173746,1176591,1179444,1182370,1185244,1188093,1190925,1193801,1196660,1199545,1202432,1205285,1208198,1211026,1213868,1216688,1219588,1222393,1225259,1228119,1230996,1233830,1236682,1239605,1242422,1245272,1248112,1250996,1253792,1256652,1259537,1262363,1265205,1268047,1270890,1273689,1276506,1279377,1282286,1285127,1287980,1290771,1293580,1296434,1299249,1302081,1304899,1307765,1310565,1313437,1316314,1319179,1321953,1324799,1327680,1330570,1333417,1336222,1339091,1341880,1344730,1347558,1350402,1353252,1356098,1358925,1361746,1364529,1367411,1370266,1373089,1375934,1378787,1381608,1384448,1387240,1390062,1392850,1395709,1398555,1401374,1404179,1407069,1409899,1412745,1415626,1418381,1421271,1424100,1426913,1429775,1432595,1435430,1438258,1441129,1443939,1446779,1449605,1452383,1455248,1458083,1460920,1463729,1466529,1469369,1472195,1475031,1477838,1480667,1483501,1486323,1489166,1491981,1494787,1497648,1500453,1503239,1506081,1508873,1511686,1514527,1517367,1520184,1523011,1525806,1528622,1531402,1534201,1536997,1539894,1542683,1545503,1548241,1551093,1553884,1556702,1559565,1562352,1565117,1567943,1570716,1573536,1576359,1579176,1581960,1584772,1587542,1590356,1593212,1596005,1598783,1601564,1604386,1607165,1609974,1612824,1615617,1618452,1621217,1624007,1626767,1629636,1632421,1635222,1637991,1640857,1643718,1646485,1649297,1652064,1654854,1657619,1660460,1663265,1666081,1668892,1671700,1674594,1677356,1680125,1682935,1685691,1688539,1691341,1694101,1696863,1699639,1702441,1705278,1708110,1710912,1713725,1716510,1719267,1722095,1724880,1727671,1730436,1733217,1736052,1738807,1741642,1744421,1747205,1750007,1752772,1755537,1758337,1761093,1763839,1766647,1769444,1772246,1775046,1777876,1780671,1783464,1786236,1789019,1791841,1794680,1797448,1800274,1803074,1805871,1808647,1811416,1814143,1816933,1819707,1822528,1825244,1828005,1830793,1833548,1836360,1839214,1841996,1844792,1847581,1850327,1853089,1855856,1858663,1861433,1864207,1866991,1869796,1872540,1875345,1878117,1880878,1883646,1886490,1889297,1892075,1894867,1897679,1900521,1903296,1906069,1908797,1911589,1914346,1917129,1919906,1922737,1925489,1928318,1931029,1933873,1936618,1939421,1942195,1944975,1947727,1950518,1953327,1956076,1958882,1961653,1964430,1967231,1969999,1972724,1975510,1978238,1981017,1983809,1986618,1989438,1992205,1994950,1997721,2000489,2003304,2006033,2008816,2011607,2014373,2017180,2019933,2022702,2025513,2028256,2031020,2033803,2036610,2039323,2042136,2044905,2047682,2050502,2053230,2055971,2058719,2061484,2064275,2067035,2069780,2072561,2075349,2078104,2080845,2083584,2086330,2089097,2091864,2094672,2097407,2100185,2102972,2105738,2108433,2111259,2113990,2116784,2119527,2122304,2125069,2127838,2130618,2133419,2136173,2138962,2141713,2144481,2147172,2149924,2152702,2155442,2158237,2161008,2163758,2166537,2169247,2171965,2174706,2177470,2180269,2183018,2185806,2188547,2191332,2194100,2196835,2199596,2202324,2205083,2207860,2210669,2213444,2216182,2218953,2221739,2224515,2227246,2230006,2232708,2235482,2238231,2240991,2243756,2246480,2249227,2252025,2254788,2257554,2260312,2263079,2265828,2268545,2271245,2274003,2276736,2279483,2282217,2284983,2287747,2290512,2293240,2295997,2298702,2301494,2304177,2306931,2309704,2312443,2315163,2317910,2320691,2323417,2326186,2328942,2331676,2334374,2337139,2339871,2342642,2345411,2348163,2350887,2353608,2356373,2359139,2361872,2364678,2367432,2370149,2372878,2375651,2378388,2381162,2383896,2386653,2389450,2392222,2394902,2397618,2400363,2403099,2405857,2408603,2411351,2414127,2416904,2419627,2422296,2425056,2427745,2430503,2433251,2436001,2438719,2441528,2444352,2447016,2449765,2452482,2455256,2458031,2460744,2463429,2466187,2468912,2471679,2474403,2477113,2479832,2482617,2485399,2488154,2490869,2493631,2496331,2499026,2501804,2504528,2507234,2509986,2512726,2515473,2518175,2520875,2523614,2526330,2529122,2531839,2534604,2537308,2540008,2542791,2545541,2548284,2551055,2553802,2556546,2559256,2562021,2564750,2567510,2570148,2572929,2575664,2578403,2581128,2583836,2586615,2589384,2592090,2594819,2597536,2600254,2602944,2605706,2608394,2611086,2613806,2616565,2619321,2622048,2624787,2627470,2630206,2632916,2635613,2638344,2641068,2643874,2646581,2649274,2651923,2654664,2657389,2660089,2662840,2665564,2668329,2671039,2673788,2676540,2679254,2682014,2684761,2687515,2690185,2692884,2695614,2698331,2701067,2703798,2706497,2709174,2711871,2714585,2717374,2720152,2722854,2725559,2728236,2730937,2733698,2736447,2739146,2741927,2744682,2747379,2750078,2752811,2755521,2758290,2761026,2763725,2766426,2769153,2771910,2774616,2777363,2780032,2782759,2785459,2788181,2790935,2793661,2796375,2799109,2801844,2804531,2807261,2809930,2812655,2815400,2818088,2820817,2823539,2826276,2828967,2831689,2834417,2837100,2839799,2842571,2845296,2847955,2850686,2853362,2856131,2858814,2861494,2864215,2866912,2869649,2872353,2875061,2877770,2880505,2883226,2885940,2888661,2891324,2894042,2896737,2899482,2902173,2904857,2907606,2910319,2913026,2915749,2918453,2921165,2923834,2926597,2929265,2931966,2934703,2937422,2940118,2942867,2945636,2948312,2951035,2953764,2956447,2959193,2961881,2964616,2967240,2969938,2972638,2975367,2978051,2980755,2983431,2986123,2988902,2991612,2994331,2997075,2999799,3002504,3005203,3007900,3010597,3013324,3016009,3018743,3021417,3024129,3026843,3029542,3032258,3034938,3037647,3040326,3043022,3045754,3048458,3051170,3053831,3056533,3059268,3061963,3064626,3067352,3069997,3072755,3075490,3078186,3080941,3083637,3086305,3089049,3091766,3094461,3097083,3099791,3102503,3105214,3107929,3110676,3113376,3116121,3118822,3121506,3124226,3126914,3129663,3132389,3135041,3137800,3140465,3143179,3145895,3148595,3151359,3154060,3156704,3159381,3162037,3164764,3167422,3170165,3172860,3175583,3178276,3180981,3183679,3186336,3189067,3191741,3194439,3197144,3199905,3202633,3205350,3208093,3210815,3213514,3216212,3218845,3221531,3224234,3226984,3229664,3232326,3235040,3237756,3240412,3243108,3245793,3248448,3251142,3253794,3256465,3259118,3261786,3264499,3267184,3269881,3272566,3275208,3277990,3280684,3283348,3286023,3288733,3291422,3294158,3296809,3299511,3302209,3304882,3307587,3310219,3312951,3315658,3318340,3321024,3323750,3326372,3329060,3331730,3334387,3337067,3339778,3342472,3345126,3347848,3350545,3353226,3355956,3358630,3361303,3363969,3366670,3369387,3372104,3374796,3377477,3380175,3382885,3385555,3388181,3390855,3393551,3396270,3398959,3401658,3404348,3407022,3409749,3412424,3415112,3417799,3420476,3423164,3425804,3428513,3431140,3433831,3436495,3439209,3441873,3444597,3447272,3450005,3452685,3455326,3458010,3460716,3463433,3466044,3468740,3471402,3474095,3476807,3479443,3482094,3484813,3487498,3490171,3492860,3495568,3498297,3500974,3503652,3506387,3509080,3511783,3514444,3517154,3519834,3522520,3525176,3527908,3530582,3533256,3535969,3538668,3541338,3543978,3546667,3549376,3552022,3554739,3557385,3560090,3562780,3565457,3568117,3570777,3573441,3576162,3578838,3581527,3584202,3586899,3589608,3592224,3594895,3597609,3600284,3602937,3605598,3608315,3611057,3613719,3616375,3619063,3621779,3624437,3627138,3629813,3632494,3635172,3637897,3640546,3643225,3645881,3648522,3651242,3653950,3656685,3659419,3662084,3664727,3667446,3670105,3672775,3675493,3678172,3680848,3683590,3686168,3688865,3691503,3694149,3696775,3699495,3702151,3704779,3707476,3710195,3712861,3715571,3718229,3720907,3723622,3726326,3729014,3731697,3734399,3737057,3739687,3742387,3745052,3747736,3750447,3753093,3755763,3758470,3761125,3763798,3766488,3769101,3771838,3774512,3777096,3779799,3782494,3785161,3787804,3790455,3793100,3795810,3798471,3801142,3803841,3806532,3809252,3811893,3814570,3817240,3819899,3822594,3825303,3827949,3830626,3833257,3835966,3838551,3841206,3843893,3846531,3849184,3851821,3854488,3857123,3859809,3862541,3865213,3867908,3870566,3873197,3875855,3878498,3881127,3883820,3886491,3889196,3891882,3894547,3897254,3899883,3902460,3905110,3907779,3910369,3913050,3915712,3918400,3921049,3923696,3926401,3929085,3931738,3934443,3937079,3939772,3942498,3945191,3947875,3950555,3953194,3955921,3958645,3961297,3963906,3966568,3969211,3971880,3974536,3977155,3979753,3982460,3985072,3987720,3990416,3993126,3995735,3998438,4001109,4003807,4006464,4009128,4011827,4014469,4017140,4019846,4022481,4025096,4027765,4030424,4033095,4035734,4038441,4041068,4043777,4046464,4049121,4051770,4054424,4057114,4059771,4062451,4065123,4067794,4070475,4073176,4075821,4078473,4081177,4083782,4086435,4089090,4091774,4094421,4097099,4099748,4102417,4105056,4107702,4110356,4113050,4115722,4118385,4121052,4123728,4126380,4129050,4131700,4134353,4137024,4139686,4142364,4145061,4147677,4150324,4153011,4155686,4158364,4160967,4163597,4166236,4168923,4171606,4174224,4176870,4179522,4182183,4184850,4187489,4190141,4192811,4195422,4198063,4200732,4203355,4206045,4208687,4211357,4213982,4216686,4219357,4221985,4224628,4227283,4229915,4232565,4235233,4237862,4240503,4243170,4245785,4248402,4251066,4253702,4256360,4259015,4261661,4264294,4266922,4269625,4272264,4274957,4277598,4280202,4282798,4285399,4288065,4290688,4293351,4296021,4298654,4301295,4303982,4306609,4309218,4311887,4314529,4317235,4319923,4322593,4325294,4327912,4330591,4333234,4335879,4338516,4341144,4343802,4346451,4349053,4351735,4354389,4357049,4359663,4362342,4364926,4367588,4370299,4372936,4375553,4378193,4380845,4383575,4386240,4388879,4391542,4394200,4396851,4399521,4402187,4404832,4407487,4410086,4412694,4415371,4418023,4420721,4423372,4425992,4428609,4431243,4433902,4436580,4439170,4441823,4444490,4447138,4449673,4452307,4454923,4457555,4460241,4462894,4465544,4468140,4470785,4473457,4476148,4478750,4481417,4484076,4486724,4489312,4492007,4494652,4497293,4499966,4502619,4505253,4507856,4510573,4513194,4515919,4518560,4521186,4523774,4526427,4529073,4531708,4534347,4536968,4539593,4542204,4544861,4547523,4550196,4552844,4555492,4558141,4560804,4563438,4566061,4568706,4571337,4574015,4576657,4579285,4581977,4584687,4587326,4589993,4592654,4595266,4597877,4600572,4603201,4605817,4608469,4611140,4613737,4616385,4619006,4621593,4624232,4626876,4629508,4632187,4634797,4637399,4640031,4642678,4645360,4647919,4650560,4653231,4655889,4658586,4661190,4663804,4666451,4669055,4671705,4674351,4676997,4679633,4682243,4684949,4687533,4690161,4692790,4695463,4698103,4700735,4703363,4706007,4708643,4711274,4713900,4716608,4719202,4721853,4724481,4727184,4729855,4732496,4735168,4737851,4740486,4743083,4745721,4748367,4750950,4753627,4756289,4758913,4761561,4764205,4766823,4769430,4772013,4774673,4777296,4779967,4782597,4785262,4787905,4790546,4793167,4795770,4798436,4801064,4803668,4806333,4808985,4811623,4814267,4816891,4819529,4822161,4824805,4827436,4830058,4832685,4835379,4838000,4840681,4843322,4845982,4848640,4851212,4853838,4856492,4859127,4861763,4864388,4867028,4869676,4872296,4874854,4877529,4880180,4882798,4885427,4888078,4890746,4893365,4896011,4898673,4901286,4903891,4906512,4909157,4911785,4914384,4917033,4919690,4922306,4924919,4927573,4930213,4932818,4935488,4938140,4940775,4943379,4946070,4948680,4951297,4953911,4956558,4959210,4961878,4964538,4967185,4969806,4972410,4975039,4977662,4980311,4982941,4985647,4988226,4990898,4993516,4996145,4998802,5001443,5004057,5006709,5009406,5012065,5014695,5017340,5019950,5022572,5025179,5027802,5030447,5033047,5035681,5038280,5040863,5043508,5046095,5048766,5051412,5054025,5056629,5059278,5061913,5064512,5067205,5069825,5072492,5075114,5077659,5080256,5082860,5085500,5088135,5090728,5093333,5095989,5098616,5101203,5103826,5106459,5109090,5111744,5114362,5116967,5119591,5122214,5124845,5127515,5130154,5132783,5135431,5138076,5140731,5143346,5145981,5148606,5151275,5153900,5156547,5159150,5161734,5164342,5166954,5169574,5172232,5174885,5177522,5180106,5182723,5185364,5187966,5190596,5193213,5195881,5198500,5201126,5203797,5206415,5209050,5211713,5214289,5216846,5219488,5222091,5224741,5227387,5230075,5232642,5235256,5237883,5240497,5243171,5245787,5248349,5250964,5253604,5256295,5258925,5261560,5264198,5266812,5269432,5272057,5274678,5277359,5279981,5282588,5285176,5287825,5290378,5292984,5295576,5298144,5300709,5303300,5305965,5308565,5311160,5313783,5316423,5319019,5321597,5324214,5326785,5329410,5332021,5334623,5337228,5339868,5342497,5345130,5347796,5350422,5353090,5355703,5358368,5360987,5363545,5366148,5368777,5371412,5374088,5376687,5379310,5381929,5384561,5387172,5389785,5392412,5395046,5397629,5400260,5402887,5405527,5408176,5410794,5413434,5415999,5418615,5421235,5423862,5426485,5429133,5431730,5434359,5436989,5439576,5442164,5444785,5447430,5450050,5452630,5455226,5457874,5460458,5463064,5465636,5468292,5470840,5473438,5476040,5478624,5481234,5483862,5486492,5489062,5491685,5494277,5496930,5499560,5502195,5504849,5507484,5510039,5512631,5515229,5517813,5520451,5523148,5525740,5528354,5530960,5533526,5536136,5538821,5541485,5544171,5546787,5549334,5551962,5554594,5557156,5559794,5562401,5564989,5567668,5570318,5572922,5575559,5578173,5580735,5583348,5585968,5588600,5591257,5593883,5596537,5599126,5601766,5604343,5606978,5609544,5612150,5614795,5617364,5619974,5622604,5625220,5627890,5630520,5633085,5635731,5638332,5640958,5643587,5646179,5648777,5651328,5653955,5656616,5659237,5661891,5664467,5667110,5669724,5672315,5674898,5677516,5680112,5682698,5685283,5687873,5690537,5693138,5695725,5698354,5700962,5703597,5706173,5708793,5711418,5713948,5716608,5719236,5721870,5724432,5727030,5729670,5732291,5734927,5737555,5740151,5742760,5745303,5747922,5750484,5753109,5755700,5758284,5760903,5763488,5766103,5768742,5771329,5773921,5776526,5779099,5781662,5784324,5786983,5789590,5792263,5794904,5797482,5800089,5802685,5805349,5807963,5810588,5813145,5815758,5818375,5820930,5823533,5826127,5828742,5831423,5834055,5836688,5839332,5841893,5844529,5847110,5849741,5852352,5854947,5857519,5860154,5862786,5865406,5868021,5870662,5873255,5875845,5878520,5881140,5883729,5886329,5888952,5891561,5894167,5896791,5899352,5901946,5904577,5907199,5909822,5912399,5914980,5917583,5920157,5922796,5925412,5928032,5930672,5933314,5935941,5938528,5941165,5943777,5946380,5949001,5951600,5954206,5956845,5959490,5962107,5964740,5967358,5969954,5972550,5975142,5977742,5980358,5982939,5985529,5988135,5990733,5993379,5995955,5998500,6001091,6003727,6006283,6008887,6011523,6014158,6016757,6019332,6021859,6024475,6027082,6029692,6032264,6034853,6037496,6040041,6042691,6045299,6047914,6050499,6053126,6055662,6058265,6060852,6063464,6066107,6068704,6071358,6073902,6076512,6079117,6081675,6084293,6086846,6089462,6092066,6094754,6097313,6099890,6102471,6105113,6107732,6110282,6112891,6115533,6118146,6120762,6123306,6125905,6128580,6131219,6133813,6136360,6139005,6141600,6144218,6146820,6149371,6152008,6154675,6157271,6159871,6162461,6164976,6167591,6170168,6172803,6175450,6178055,6180645,6183213,6185805,6188462,6191134,6193761,6196339,6198883,6201446,6204006,6206615,6209208,6211825,6214485,6217047,6219685,6222252,6224827,6227426,6230025,6232618,6235254,6237903,6240568,6243137,6245745,6248383,6250968,6253594,6256157,6258704,6261229,6263772,6266353,6268950,6271545,6274153,6276725,6279295,6281850,6284431,6287079,6289703,6292248,6294880,6297458,6300083,6302647,6305225,6307854,6310423,6313002,6315578,6318146,6320783,6323413,6326011,6328577,6331172,6333770,6336395,6339009,6341630,6344208,6346739,6349347,6351927,6354521,6357116,6359727,6362295,6364935,6367512,6370124,6372759,6375330,6377932,6380538,6383126,6385750,6388317,6390928,6393566,6396156,6398760,6401309,6403894,6406444,6409020,6411621,6414240,6416840,6419444,6421985,6424585,6427175,6429774,6432352,6434905,6437478,6440084,6442694,6445293,6447930,6450524,6453111,6455682,6458326,6460917,6463538,6466171,6468741,6471304,6473882,6476474,6479075,6481719,6484300,6486895,6489472,6492070,6494656,6497314,6499923,6502519,6505097,6507692,6510279,6512873,6515451,6518114,6520675,6523259,6525868,6528444,6531066,6533690,6536273,6538887,6541470,6544021,6546672,6549285,6551864,6554452,6556996,6559587,6562188,6564770,6567411,6569951,6572574,6575116,6577700,6580260,6582892,6585456,6588087,6590708,6593326,6595957,6598515,6601071,6603686,6606273,6608834,6611498,6614095,6616698,6619295,6621894,6624418,6627012,6629605,6632211,6634763,6637327,6639847,6642444,6645043,6647598,6650124,6652723,6655351,6657923,6660525,6663028,6665670,6668208,6670804,6673402,6676025,6678603,6681238,6683806,6686331,6688966,6691555,6694117,6696711,6699329,6701946,6704527,6707200,6709795,6712367,6714983,6717599,6720189,6722794,6725391,6727968,6730547,6733134,6735695,6738207,6740828,6743394,6745968,6748552,6751153,6753724,6756299,6758910,6761489,6764062,6766666,6769185,6771775,6774395,6776965,6779497,6782076,6784634,6787249,6789787,6792400,6795031,6797654,6800239,6802810,6805406,6807999,6810601,6813192,6815770,6818374,6820939,6823539,6826057,6828648,6831224,6833809,6836379,6838975,6841545,6844146,6846743,6849310,6851866,6854427,6857053,6859666,6862301,6864928,6867491,6870031,6872597,6875182,6877737,6880327,6882924,6885471,6888050,6890595,6893240,6895824,6898361,6900909,6903508,6906086,6908592,6911194,6913799,6916351,6918938,6921532,6924153,6926760,6929345,6932010,6934558,6937122,6939699,6942266,6944833,6947433,6950048,6952622,6955229,6957811,6960447,6963003,6965624,6968229,6970814,6973374,6975908,6978553,6981142,6983701,6986303,6988895,6991452,6994053,6996636,6999239,7001827,7004386,7006943,7009509,7012092,7014637,7017247,7019911,7022468,7025101,7027733,7030312,7032873,7035446,7038006,7040537,7043119,7045744,7048342,7050888,7053483,7056063,7058671,7061274,7063885,7066487,7069099,7071649,7074208,7076794,7079414,7081992,7084585,7087182,7089730,7092253,7094829,7097378,7099975,7102560,7105136,7107734,7110341,7112923,7115505,7118105,7120687,7123329,7125909,7128529,7131104,7133676,7136261,7138851,7141412,7143963,7146532,7149099,7151678,7154306,7156895,7159502,7162172,7164744,7167291,7169862,7172477,7175070,7177687,7180299,7182859,7185447,7188010,7190543,7193111,7195725,7198306,7200837,7203410,7206026,7208623,7211221,7213777,7216339,7218922,7221467,7224118,7226696,7229224,7231835,7234448,7237074,7239661,7242248,7244831,7247438,7250010,7252624,7255179,7257777,7260342,7262872,7265456,7267970,7270545,7273095,7275708,7278251,7280851,7283410,7285994,7288560,7291115,7293745,7296316,7298848,7301442,7304018,7306655,7309180,7311705,7314293,7316887,7319531,7322112,7324659,7327260,7329881,7332442,7335022,7337604,7340210,7342739,7345280,7347817,7350378,7352945,7355504,7358025,7360615,7363210,7365832,7368429,7371013,7373605,7376145,7378732,7381276,7383811,7386365,7388933,7391502,7394032,7396642,7399245,7401866,7404457,7406982,7409538,7412102,7414691,7417288,7419884,7422441,7424989,7427522,7430101,7432639,7435216,7437740,7440294,7442912,7445516,7448114,7450684,7453261,7455841,7458445,7461027,7463635,7466198,7468787,7471320,7473930,7476552,7479118,7481641,7484264,7486781,7489342,7491952,7494521,7497063,7499688,7502254,7504815,7507392,7509988,7512553,7515087,7517707,7520308,7522824,7525392,7527945,7530543,7533105,7535700,7538260,7540804,7543418,7545943,7548535,7551130,7553729,7556313,7558844,7561435,7563980,7566505,7569080,7571641,7574170,7576783,7579338,7581897,7584422,7587022,7589577,7592151,7594705,7597276,7599794,7602390,7604973,7607619,7610137,7612748,7615269,7617858,7620416,7622960,7625549,7628196,7630753,7633277,7635834,7638354,7640910,7643496,7646121,7648660,7651279,7653833,7656431,7659011,7661580,7664134,7666612,7669193,7671776,7674356,7676915,7679488,7682031,7684595,7687146,7689731,7692293,7694861,7697419,7700031,7702574,7705205,7707783,7710348,7712918,7715474,7718028,7720597,7723207,7725778,7728305,7730889,7733442,7736038,7738641,7741178,7743670,7746199,7748766,7751407,7753967,7756540,7759095,7761686,7764213,7766793,7769379,7771905,7774461,7777035,7779545,7782119,7784671,7787226,7789834,7792385,7795028,7797627,7800194,7802758,7805346,7807903,7810459,7813000,7815577,7818155,7820761,7823285,7825842,7828445,7830988,7833550,7836167,7838714,7841312,7843890,7846422,7848885,7851434,7854000,7856583,7859172,7861776,7864364,7866909,7869478,7872018,7874591,7877131,7879768,7882314,7884851,7887428,7890024,7892632,7895233,7897844,7900429,7902975,7905546,7908066,7910582,7913125,7915728,7918312,7920913,7923470,7926037,7928634,7931211,7933766,7936281,7938828,7941378,7943902,7946432,7949032,7951602,7954217,7956760,7959316,7961868,7964451,7967003,7969567,7972124,7974694,7977293,7979866,7982413,7985018,7987569,7990128,7992722,7995266,7997861,8000394,8002935,8005473,8008047,8010615,8013200,8015753,8018323,8020862,8023413,8025983,8028499,8031030,8033583,8036158,8038758,8041400,8043966,8046482,8049029,8051591,8054132,8056748,8059305,8061849,8064377,8066944,8069508,8072033,8074668,8077206,8079782,8082323,8084914,8087510,8090092,8092568,8095135,8097678,8100189,8102726,8105256,8107767,8110337,8112936,8115467,8118011,8120631,8123161,8125719};
const int MX = 300000001;
ull b0[(MX + 63) / 64];

namespace Bitset {
	inline bool test(ull* pb, int pos) {
	    return (*(pb+(pos >> 8)) >> (pos & 63)) & 1;
	}
	inline void set(ull* pb, int pos) {
		*(pb+(pos >> 8)) |= (ull(1) << (pos & 63));
	}
}

int solve(int n)
{
    if (n == 0)
        return 0;
    int p = (n - 1) / 100000;
    int x = (p + 1) * 100000;
    int ans = cnt_good[p];
    init(n, x);
    while (x > n)
    {
        answ -= (Bitset::test(b0, x) && e[x - n]);
        x--;
    }
    return ans;
}

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 0.95 * CLOCKS_PER_SEC;
    //double t = clock();
    //ll counter = 0;
    for (int i = 1, i2 = 1; i2 <= 300000000; i2 += (i << 1) + 1, ++i)
        for (int j = 1, j2 = 1; i2 + j2 <= 300000000; j2 += (j << 1) + 1, ++j) {
            //++counter;
            Bitset::set(b0, i2+j2);
            //b0[(i2+j2) >> 8] |= ull(1) << ((i2 + j2) & 63);
        }
    //std::cout << "time1 = " << (clock() - t) / CLOCKS_PER_SEC  << ", counter = " << counter << std::endl;
    /*b.set(0); b.set(1);
    for (int i = 2; i <= 300000000; i++)
        if (!b.test(i))
            for (int j = i * 2; j <= 300000000; j += i)
                b.set(j);
    int cnt = 0;
    for (int i = 1; i <= 300000000; i++)
    {
        if (b0.test(i) && !b.test(i))
            cnt++;
        if (i % 100000 == 0)
            cout << cnt << ",";
    }*/
    int l, r;
    cin >> l >> r;
    cout << solve(r) - solve(l - 1) << "\n";
    return 0;
}


#include<iostream>
using namespace std;
int main ()
{
    int a;
    cin>>a;
    if(a%2=0)
    {cout("0"); }
    else if (a%2!=0)
    {cout("1");}

    }


#iinclude <iostream>

using namespace std;

int main()
{
    long long a;
    cin>>a;
    cout << a%2;

    return 0;
}


#include<bits/stdc++.h>
usingnamespace std;
int main()
{
    int a;
    cin>>a;
    if<n%2==0> cout<<0;
    else cout<<1;
}


#include <bits/stdc++.h>

#define MAXN 100010

using namespace std;

int main(){

//    freopen("a.in", "r", stdin);

    int a;

    scanf("%d\n", &a);

    srand(time(NULL));

    printf("%d\n", rand()%1)

return 0;
}


#include <iostream>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <list>
#include <fstream>
#define ull unsigned long long
#define ll long long
#define ld long double
#define pi 3.1415926536
#define lp(i,n,a) for(ll i=a;i<=n;i++)
#define pl(i,n) for(ll i=n-1;i>=0;i--)
#define w while
#define re return
// Hard Training :D
// hossam yehia //
using namespace std;
ll n, m, maxi, a, b, f, out;
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	a = n, b = m;
	while (a) {
		maxi = max(maxi, (a % 10)),a /= 10;
	while (b) {
		maxi = max(maxi, (b % 10)),b /= 10;
	maxi++;
	while (n || m || f) {
		f += (a % 10) + (b % 10);
		f /= maxi;
		n /= 10, m /= 10;
		out++;
	}
	cout << out << endl;
	cin >> n;
	re 0;
}


#include<iostream>
#include<cstring>
#include<math.h>
using namespace std;

int main()
{
    int a,b,r;
    cin>>a>>b;
   int q=a;
   int max=0;int n1=0,n2=0;
    while(q!=0)
    { r=q%10;
    q=q/10;
    max=max>r?max:r;
    n1++;
}
q=b;
while(q!=0)
    { r=q%10;
    q=q/10;
    max=max>r?max:r;
    n2++;
}
max++;

int c=0,i=0,sum=0,x,y;
while(a!=0 && b!=0)
{
           x=a%10;
           y=b%10;
          double k=((double)((x+y+c)%max)*pow(10,i));
                         sum=k*(int)pow(10,i)+sum;c=(x+y+c)/max;

           i++;
           a=a/10;b=b/10;

}
double k=((double)c*pow(10,i));
sum=k+sum;
n2=0;

q=sum;
while(q!=0)
    {
    q=q/10;
    n2++;
}
cout<<n2<<endl;
    system("pause");
    return 0;
}


// rau_49_b.cpp: определяет точку входа для консольного приложения.
//

#include <iostream>
#include <string.h>

using namespace std;
int a,b,x,y,q,c,c1;
string s;
string st[16]={"0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"};

int _tmain(int argc, _TCHAR* argv[])
{
    cin>>a>>b;
    x=a; y=b; q=0;

    do {
        c=a%10;
        if (q<c) q=c;
        a=a/10;
    }
    while (a>0);

    do {
        c=b%10;
        if (q<c) q=c;
        b=b/10;
    }
    while (b>0);

    q+=1; c=1;
    do
    {
        a+=(x%10)*c;
        c=c*q;
        x=x/10;
    }
    while (x>0);

    c=1;
    do
    {
        b+=(y%10)*c;
        c=c*q;
        y=y/10;
    }
    while (y>0);

    a+=b; s=""; q+=1;
    do
    {
        c=a%q;
        s+=st[c];
        a=a/q;
    }
    while (a>0);

    cout<<s.length()<<endl;

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int main() {

int a,b;
cin>>a>>b;
int n=a+b;
int aa=a,bb=b;
int ma=0;
vector<int>v1,v2;
while(b)
{
	ma=max(ma,b%10);
	int k=b%10;
	v1.pb(k);
	b/=10;
}
while(a)
{
	ma=max(ma,a%10);
	int k=a%10;
	v2.pb(k);
	a/=10;
}
ma++;
int l=v1.size();
int m=v2.size();
while(l<m)
{
	l++;
	v1.pb(0);
}
while(l>m)
{
	m++;
	v2.pb(0);
}
int carry=0;
int count=0;
int i;
for( i=0;i<v1.size() and i<v2.size();i++)
{
	int x=carry+v1[i];
	carry=x/ma;
	int fin=x%ma+v2[i];
	if(fin>=ma)
	{
		int y=fin%ma;
		carry+=fin/ma;
		count++;
	}
	else
	{
		count++;
	}
}
if(carry!=0)
count++;

cout<<count<<endl;

}


#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    vector <int> v;
    set <int> s;
    for(int i=0;i<n;i++)
    {
        int a;
        cin>>a;
        v.push_back(a);
        s.insert(a);
    }
    vector <int> v1(s.begin(),s.end());
    ll t(0);
    while(v1.size()!=0)
    {
        sort(v1.begin(),v1.end());
        for(int i=0;i<v1.size();i++)
        {
            if(v1[i]%v1[0]==0 i>0)
            {
                v1.erase(v.begin()+i);
                t++;
            }
            v1.erase(v.begin());
        }
    }
    cout<<t<<endl;
    return(0);
}


#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[501],n;
int main()
{
    int i,m,sum=0;
    scanf("%d",&n);
    for(i=0; i<n; i++){
        scanf("%d",&m);
        a[m]++;
    }
    for(i=1; i<101; i++){
        if(a[i]!=0){
            for(m=2; i*m<101; m++){
                a[i]+=a[i*m];
                a[i*m]=0;
            }
            sum++;
        }
    }
    printf("%d",sum);
    return 0;


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

bool isprime(int x)
{
	if(x == 1) return false;
	for(int i=2;i*i<=x;i++)
	{
		if(x%i==0)
		return false;
	}
	return true;
}
int main()
{
	int n;cin>>n;
	int f1=0,f2=0,f3=0,cnt=0,f5=0,f7=0;
	int f[101]={0};
	vector<int>v;
	for(int i=1,x;i<=n;i++)
	{
		cin>>x;
		f[x]++;
	}
	for(int i=1;i<=100;i++)
	{
		if(f[i] != 0)
		v.pb(i);
	}

	for(int i=0,x;i<v.size();i++)
	{
		x = v[i];

		if(x==1)
		f1=1;
		else if(x%2 == 0)
		f2=1;
		else if(x%3 == 0)
		f3=1;
		else if(x%5 == 0)
		f5=1;
		else if(x%7 == 0)
		f7 = 1;
		else if(isprime(x))
		cnt++;
	}
	cout<<cnt+f1+f2+f3+f5+f7<<endl;

}


#include<bits/stdc++.h>
using namespace std;
int a,b,c;
main() {
    cin>>a>>b>>c;
    if(a+b>c) cout<<a+b+c; else {2*(a+b)};
   }


#include <vector>
#include <iostream>
#include <string>

using namespace std;

int main() {
	int d1, d2, d3;
		cin >> d1 >> d2 >> d3;
	cout << min (d1 + d2 + d3 , d1 * 2 + d2 * 2 min ( d1 * 2 + d2 * 2  ,2 * d2 + 2 * d3)) << endl;
	return 0;
}


#include <iostream>
using namespace std;

int main() {
int x,y,z;
int sum=0;
cin>>x>>y>>z;
su=x+y;
if(sum==z)
	cout<<sum+z;
else
cout<<z-1;
	return 0;
}