#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif

// Verify : http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1102
// Verify : http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0264

class zerodive {};

#undef MCR
#define MCR Mint const &
int M;
struct Mint {
    int x;
    explicit Mint()
        : x(0) {}
    explicit Mint(int y){
        if((x = y%M + M) >= M) x-= M;
    }
    Mint & operator += (MCR m){
        if((x += m.x) >= M) x-=M;
        return *this;
    }
    Mint & operator -= (MCR m){
        if((x += M-m.x) >= M) x-=M;
        return *this;
    }
    Mint & operator *= (MCR m){
        x = 1LL * x * m.x % M;
        return *this;
    }
    Mint & operator /= (MCR m){
        if(m.x % M == 0) throw zerodive();
        x = (1LL * x * m.exp(M-2).x) % M;
        return *this;
    }
    Mint operator + (MCR m) const {
        return Mint(*this) += m;
    }
    Mint operator - (MCR m) const {
        return Mint(*this) -= m;
    }
    Mint operator * (MCR m) const {
        return Mint(*this) *= m;
    }
    Mint operator / (MCR m) const {
        return Mint(*this) /= m;
    }
    bool operator < (MCR m) const {
        return x < m.x;
    }
    Mint inv() const {
        return exp(M-2);
    }
    Mint exp(long long t) const {
        /* !! default 0^0 = 1 !! */
        // if(x==0) return Mint(0);
        Mint e = *this, res = Mint(1);
        for(; t; e*=e, t>>=1) if(t&1) res *= e;
        return res;
    }
};
ostream &operator << (ostream & os, Mint m){
    return os << m.x;
}

class ExpressionParser {
public:
    typedef Mint C;
    struct overflow {};
    struct parseError {
        string mes;
        parseError(string const & s) : mes(s) {}
    };
    explicit ExpressionParser(string const & s)
        : e(s), pos(e.begin()) {
    }
    C parse() {
        return expr(pos);
    }

private:
    typedef string::iterator iter;
    string e;
    iter pos;

    bool valid(C){
        return true;
    }
    bool ispm(char c){
        return c=='+' || c=='-';
    }
    bool ispd(char c){
        return c=='*' || c=='/';
    }

    bool isBegNum(iter p){
        return isdigit(*p) || *p == 'i';
    }
    bool isEndNum(iter p){
        return p==e.end() || *p==')' || ispm(*p) || ispd(*p);
    }
    bool isBegFact(iter p){
        return *p=='(' || isdigit(*p) || *p == 'i';
    }
    bool isEndFact(iter p){
        return p==e.end() || *p==')' || ispm(*p) || ispd(*p);
    }
    bool isBegTerm(iter p){
        return *p=='(' || isdigit(*p) || *p == 'i';
    }
    bool isEndTerm(iter p){
        return true;
    }
    bool isBeginExp(iter p){
        return *p=='(' || isdigit(*p) || *p == 'i';
    }
    bool isEndExp(iter p){
        return true;
    }
    C num(iter & p){
        if(!isBegNum(p)) throw parseError("num begin");
        C res(0);
        if(isdigit(*p)){
            while (isdigit(*p)){
                res*=C(10);
                res+=C(*p-'0');
                if(!valid(res)) throw overflow();
                p++;
            }
        } else {
            // res = C(0,1);
            p++;
        }
        if(!isEndNum(p)) throw parseError("num end");
        if(!valid(res)) throw overflow();
        return res;
    }

    C fact(iter & p){
        if(!isBegFact(p)) throw parseError("fact begin");
        C res(0);
        if(*p=='('){
            p++;
            res += expr(p);
            p++;
        } else if (isdigit(*p) || *p == 'i'){
            res += num(p);
        }

        if(!isEndFact(p)) throw parseError("fact end");
        if(!valid(res)) throw overflow();
        return res;
    }

    C term(iter & p){
        if(!isBegTerm(p)) throw parseError("term begin");
        C res = fact(p);
        while(1){
            if(*p=='*'){
                p++;
                res *= fact(p);
            } else if (*p=='/'){
                p++;
                res /= fact(p);
            } else if (p==e.end() || *p==')' || *p=='+' || *p=='-'){
                break;
            } else {
                throw parseError("term end");
            }
            if(!valid(res)) throw overflow();
        }

        if(!isEndTerm(p)) throw parseError("term end");
        if(!valid(res)) throw overflow();
        return res;
    }

    C expr(iter & p){
        if(!isBeginExp(p)) throw parseError("exp begin");

        C res = term(p);
        while(1){
            if(*p=='+'){
                p++;
                res += term(p);
            } else if (*p=='-'){
                p++;
                res -= term(p);
            } else if (p==e.end() || *p==')'){
                break;
            } else {
                throw parseError("exp end");
            }
            if(!valid(res)) throw overflow();
        }
        if(!isEndExp(p)) throw parseError("exp end");
        return res;
    }
};

typedef Mint C;


int main(){
    while(cin >> M && M){
        string s;
        getline(cin,s);
        s.erase(remove(all(s),':'), s.end());
        s.erase(remove(all(s),' '), s.end());
        ExpressionParser parser(s);
        try {
            auto ans = parser.parse();
            printf("%s = %d (mod %d)\n", s.c_str(), ans.x , M);
        } catch(...){
            puts("NG");
        }
    }
}

Measured memory_bytes: 1432