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

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"(";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<")";
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

constexpr ll Ten(int n){
	return n==0?1:Ten(n-1)*10;
}

template<class T>
vector<T> Uniqued(const vector<T>&vv){
	auto v(vv);
	sort(ALL(v));
	v.erase(unique(ALL(v)),v.end());
	return v;
}
template<class T>
void MakeUniqued(vector<T>&v){
	sort(ALL(v));
	v.erase(unique(ALL(v)),v.end());
}

template<int mod>
struct ModInt{
	static constexpr int base=mod;
	int v;
	ModInt():v(0){}
	ModInt(ll vv){
		v=vv%mod;
		if(v<0)v+=mod;
	}
	explicit operator bool()const{
		return v;
	}
	explicit operator int()const{
		return v;
	}
	bool operator==(const ModInt&rhs)const{
		return v==rhs.v;
	}
	bool operator!=(const ModInt&rhs)const{
		return v!=rhs.v;
	}
	ModInt operator-()const{
		return ModInt(0)-*this;
	}
	ModInt& operator+=(const ModInt&rhs){
		v+=rhs.v;
		if(v>=mod)v-=mod;
		return *this;
	}
	ModInt&operator-=(const ModInt&rhs){
		v-=rhs.v;
		if(v<0)v+=mod;
		return *this;
	}
	ModInt&operator*=(const ModInt&rhs){
		v=ll(v)*rhs.v%mod;
		return *this;
	}
	ModInt&operator/=(const ModInt&rhs){
		operator*=(rhs.inv());
		return *this;
	}
	ModInt operator+(const ModInt&rhs)const{
		return ModInt(*this)+=rhs;
	}
	ModInt operator-(const ModInt&rhs)const{
		return ModInt(*this)-=rhs;
	}
	ModInt operator*(const ModInt&rhs)const{
		return ModInt(*this)*=rhs;
	}
	ModInt operator/(const ModInt&rhs)const{
		return ModInt(*this)/=rhs;
	}
	friend ModInt operator+(int x,const ModInt&y){
		return ModInt(x)+y;
	}
	friend ModInt operator-(int x,const ModInt&y){
		return ModInt(x)-y;
	}
	friend ModInt operator*(int x,const ModInt&y){
		return ModInt(x)*y;
	}
	friend ModInt operator/(int x,const ModInt&y){
		return ModInt(x)/y;
	}
	ModInt pow(int n)const{
		ModInt res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	ModInt inv()const{
		return pow(mod-2);
	}
};

template<int mod>
ostream& operator<<(ostream&os,const ModInt<mod>&m){
	return os<<m.v;
}
template<int mod>
void print(const ModInt<mod>&m,int suc=1){
	print(m.v,suc);
}

using mint=ModInt<1000000007>;
//using mint=ModInt<998244353>;

const int Vmax=min<int>(2000010,mint::base);
mint fact[Vmax],factInv[Vmax],invs[Vmax];
void InitFact(){
	fact[0]=1;
	FOR(i,1,Vmax){
		fact[i]=fact[i-1]*i;
	}
	factInv[Vmax-1]=fact[Vmax-1].inv();
	for(int i=Vmax-2;i>=0;i--){
		factInv[i]=factInv[i+1]*(i+1);
	}
	for(int i=Vmax-1;i>=1;i--){
		invs[i]=factInv[i]*fact[i-1];
	}
}
struct InitFactDummy{
	InitFactDummy(){
		InitFact();
	}
} initFactDummy;
mint Choose(int n,int k){
	return fact[n]*factInv[n-k]*factInv[k];
}
mint Binom(int a,int b){
	return fact[a+b]*factInv[a]*factInv[b];
}
mint Catalan(int n){
	return Binom(n,n)-(n-1>=0?Binom(n-1,n+1):0);
}

void Answer(mint p,mint q,mint r){
	print(p,2);
	print(q,2);
	print(r);
	exit(0);
}

void AnswerImpossible(string s){
	int n=s.size();
	REP(i,n){
		if(i+3<=n&&s.substr(i,3)=="---")
			Answer(0,0,0);
		if(i+2<=n&&s.substr(i,2)=="XX")
			Answer(0,0,0);
	}
}

void AnswerLength1(string s){
	if(s=="X"){
		Answer(mint(1)/2,0,mint(-1)/2);
	}
	if(s=="-"){
		Answer(mint(1)/2,0,mint(1)/2);
	}
}

vector<mint> Magic(int n){
	vector<mint> dp(n);
	dp[0]=1;
	FOR(i,1,n){
		REP(j,i)
			dp[i]+=dp[j]*(2*(i-j)-1)*factInv[2*(i-j)];
	}
	return dp;
}

//-X-X-
vector<mint> CalcA(int n){
	vector<mint> arr=Magic(n);
	mint ans=0;
	REP(i,n){
		int s=(n-1-i)*2;
		mint p=arr[i]*factInv[s+2];
		mint q=-arr[i]*factInv[s+3];
		ans+=p;
		ans+=q;
	}
	return {ans};
}

pair<mint,mint> EvalSub(vector<mint> p){
	int n=p.size();
	pair<mint,mint> res(0,0);
	for(int i=n-1;i>=0;i--){
		if(i==0)
			res.first+=p[i];
		res.second-=p[i];
		if(i)
			p[i-1]+=i*p[i];
	}
	return res;
}

//-X-X
vector<mint> CalcB(int n){
	vector<mint> arr=Magic(n);
	vector<mint> f(n*2);
	REP(i,n){
		int s=(n-1-i)*2;
		f[s]=arr[i]*factInv[s];
		f[s+1]=-arr[i]*factInv[s+1];
	}
	auto w=EvalSub(f);
	return {w.first,w.second};
}

//X-X
vector<mint> CalcC(int n){
	assert(n>=2);
	vector<mint> arr=Magic(n-1);
	REP(i,n-2)
		arr[i+1]+=arr[i];
	mint p=mint(1)/2,q=0,r=mint(-1)/2;
	vector<mint> f(2*(n-1));
	REP(i,n-1){
		f[i*2]=arr[n-2-i]*factInv[i*2];
		f[i*2+1]=-arr[n-2-i]*factInv[i*2+1];
	}
	cerr<<f<<endl;
	auto w=EvalSub(f);
	q-=w.first;
	r-=w.second;
	return {p,q,r};
}

vector<mint> mult(vector<mint> x,vector<mint> y){
	int n=x.size(),m=y.size();
	vector<mint> z(n+m-1);
	REP(i,n)REP(j,m)
		z[i+j]+=x[i]*y[j];
	z.resize(3);
	return z;
}

signed main(){
	int n=read();
	string s=readString();
	AnswerImpossible(s);
	AnswerLength1(s);
	if(s[0]=='-'){
		if(s[1]=='-'){
			s.insert(s.begin(),'X');
		}else{
			s.erase(s.begin());
		}
	}
	AnswerLength1(s);
	n=s.size();
	if(s[n-1]=='-'){
		if(s[n-2]=='-'){
			s.PB('X');
		}else{
			s.pop_back();
		}
	}
	AnswerLength1(s);
	n=s.size();
	
	vector<mint> ans{1,0,0};
	
	int last=0;
	REP(i,n-1){
		if(s[i]=='-'&&s[i+1]=='-'){
			if(last==0){
				ans=mult(ans,CalcB((i+1)/2));
			}else{
				ans=mult(ans,CalcA((i-last)/2));
			}
			last=i+1;
		}
	}
	if(last==0)
		ans=mult(ans,CalcC((n+1)/2));
	else
		ans=mult(ans,CalcB((n-last)/2));
	Answer(ans[0],ans[1],ans[2]);
}


Measured memory_bytes: 49408