/*
このコード、と～おれ!
Be accepted!
∧＿∧ 
（｡･ω･｡)つ━☆・*。
⊂   ノ    ・゜+.
 しーＪ   °。+ *´¨)
          .· ´¸.·*´¨) ¸.·*¨)
                            (¸.·´ (¸.·'* ☆
                                        */


#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>


#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i <= (n); ++i)
#define rep2(i, n) for(int i = 2; i < (n); ++i)
#define repr(i, n) for(int i = n; i >= 0; --i)
#define reprm(i, n) for(int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a)//少数出力
#define printdbd(a) printf("%.16lf\n", a)//少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str())//string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2)//等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg)/360.0)*2.0*PI)
#define rad_to_deg(rad) (((rad)/2.0/PI)*360.0)


using ll = long long;


const int INF = 1073741823;
const int MINF = -1073741823;
const ll LINF = ll(4661686018427387903);
const ll MOD = 1000000007;
const double PI = acos(-1);


using namespace std;


void scans(string& str) {
        char c;
        scanf("%c", &c);
        if (c == '\n')scanf("%c", &c);//最初の改行対策
        while (c != '\n' && c != -1) {
                str += c;
                scanf("%c", &c);
        }
}


double acot(double x) {
        return PI / 2 - atan(x);
}


template< int mod >
struct ModInt {
        int x;


        ModInt() : x(0) {}


        ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}


        ModInt& operator+=(const ModInt& p) {
                if ((x += p.x) >= mod) x -= mod;
                return *this;
        }


        ModInt& operator-=(const ModInt& p) {
                if ((x += mod - p.x) >= mod) x -= mod;
                return *this;
        }


        ModInt& operator*=(const ModInt& p) {
                x = (int)(1LL * x * p.x % mod);
                return *this;
        }


        ModInt& operator/=(const ModInt& p) {
                *this *= p.inverse();
                return *this;
        }


        ModInt operator-() const { return ModInt(-x); }


        ModInt operator+(const ModInt& p) const { return ModInt(*this) += p; }


        ModInt operator-(const ModInt& p) const { return ModInt(*this) -= p; }


        ModInt operator*(const ModInt& p) const { return ModInt(*this) *= p; }


        ModInt operator/(const ModInt& p) const { return ModInt(*this) /= p; }


        bool operator==(const ModInt& p) const { return x == p.x; }


        bool operator!=(const ModInt& p) const { return x != p.x; }


        ModInt inverse() const {
                int a = x, b = mod, u = 1, v = 0, t;
                while (b > 0) {
                        t = a / b;
                        swap(a -= t * b, b);
                        swap(u -= t * v, v);
                }
                return ModInt(u);
        }


        ModInt pow(int64_t n) const {
                ModInt ret(1), mul(x);
                while (n > 0) {
                        if (n & 1) ret *= mul;
                        mul *= mul;
                        n >>= 1;
                }
                return ret;
        }


        friend ostream& operator<<(ostream& os, const ModInt& p) {
                return os << p.x;
        }


        friend istream& operator>>(istream& is, ModInt& a) {
                int64_t t;
                is >> t;
                a = ModInt< mod >(t);
                return (is);
        }


        static int get_mod() { return mod; }
};


using modint = ModInt< 1000000007 >;//MOD=1e9 + 7




/*-----------------------------------------ここからコード-----------------------------------------*/


int main() {


        ModInt<9> a = 1;
        ll n, p;
        bool b = false;
        scanf("%lld", &n);
        rep(i, n) {
                scanf("%lld", &p);
                a *= p;
                b += (p == 0);
        }
        if (a != 0)cout << a << endl;
        else if (b)cout << 0 << endl;
        else cout << 9 << endl;
}