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

using namespace std;

int main(){
    int n, count = 1;
    double total = 0;
    bool same = 1;
    
    cin >> n;

    double t[n], leng = n;

    for(int i = 0; i < n; i++){
        cin >> t[i];
        total += t[i];
    }
    
    sort(t, t + n);
    
    for(int i = 1; i < n; i++){
        if(t[i] == 1){
            i++;
            continue;
        }
        
        if(t[i - 1] == t[i]){
            count++;
            continue;
        }
            
        else{
            if(t[i - 1] != 1){
                same = 0;
                break;
            }
        }
    }
    

    if(n == 1)
        cout << t[0] << endl;

    else if(n == 2)
        cout << max(t[0], t[1]) << endl;

    else{
        if(count == n){
            cout << t[0] * ceil(leng/2) << endl;
        }
        
        else if(same && (count % 2) && t[n - 1] != 1)
            cout << ceil(total/2) + 1 << endl;
        
        else
            cout << ceil(total/2) << endl;
    }
    
    return 0;
}

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

template<ll MOD = 1000000007>
class ModInt {
    ll n;
    ModInt constexpr inverse() const {
        return ModInt::pow(*this, MOD - 2);
    }

public:
    ModInt() : n(0) {}
    ModInt(ll _n) : n(((_n % MOD) + MOD) % MOD) {}
    ModInt operator+=(const ModInt &m) {
        n += m.n;
        if (n >= MOD) n -= MOD;
        return *this;
    }
    ModInt operator-=(const ModInt &m) {
        n -= m.n;
        if (n < 0) n += MOD;
        return *this;
    }
    ModInt operator*=(const ModInt &m) {
        n *= m.n;
        if (n >= MOD) n %= MOD;
        return *this;
    }
    ModInt operator/=(const ModInt &m) {
        (*this) *= m.inverse();
        return *this;
    }
    friend ModInt operator+(ModInt t, const ModInt &m) {
        return t += m;
    }
    friend ModInt operator-(ModInt t, const ModInt &m) {
        return t -= m;
    }
    friend ModInt operator*(ModInt t, const ModInt &m) {
        return t *= m;
    }
    friend ModInt operator/(ModInt t, const ModInt &m) {
        return t /= m;
    }
    ModInt operator=(const ll l) {
        n = l % MOD;
        if (n < 0) n += MOD;
        return *this;
    }
    friend ostream &operator<<(ostream &out, const ModInt &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
    static constexpr ModInt pow(const ModInt x, ll p) {
        ModInt<MOD> ans = 1;
        for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
    static constexpr ll mod() {
        return MOD;
    }
};
using mint = ModInt<998244353>;
mint operator"" _m(unsigned long long m) {
    return mint(m);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h, w;
    input(h, w);
    auto dp = make_v(h, w, '.');
    rep(i, 0, h) {
        rep(j, 0, w) {
            input(dp[i][j]);
        }
    }
    vector<int> r(h + w, 0), b(h + w, 0), q(h + w, 0);
    rep(i, 0, h) {
        rep(j, 0, w) {
            if (dp[i][j] == 'R') {
                r[i + j]++;
            } else if (dp[i][j] == 'B') {
                b[i + j]++;
            } else {
                q[i + j]++;
            }
        }
    }
    mint ans = 1;
    rep(i, 0, h + w) {
        if (r[i] > 0 && b[i] > 0) {
            ans = 0;
        } else if (q[i] > 0 && (r[i] == 0 && b[i] == 0)) {
            ans *= 2;
        }
    }
    print(ans);
    return 0;
}
