#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=10,n=8;
char a[N],b[N];
int c[N],d[N],e[N],cnt[N],vis[N],ban[N],tag[N];
int main(){
	scanf("%s%s",b+1,a+1);
	memset(d,-1,sizeof d);
	memset(c,-1,sizeof c);
	memset(ban,-1,sizeof ban);
	for(int i=1;i<=n;i++)if(i%3){
		// debug(b[i],a[i]);
		vis[b[i]-'0']=1;
		if(a[i]!='B')cnt[b[i]-'0']++;
		else tag[b[i]-'0']=1;
		if(a[i]=='G')c[i]=b[i]-'0';
		else ban[i]=b[i]-'0';
	}
	vector<array<int,3> >ans;
	// debug(ary(d,0,9));
	// debug(ary(c,1,n));
	// debug(ary(vis,0,9));
	// debug(ary(cnt,0,9));
	for(int x=0;x<=99;x++){
		for(int y=0;x+y<=99;y++){
			int z=x+y;
			// if(x==11&&y==42)debug("ok");
			if(~c[1]&&c[1]!=x/10)continue;
			if(~c[2]&&c[2]!=x%10)continue;
			if(~c[4]&&c[4]!=y/10)continue;
			if(~c[5]&&c[5]!=y%10)continue;
			if(~c[7]&&c[7]!=z/10)continue;
			if(~c[8]&&c[8]!=z%10)continue;
			if(~ban[1]&&ban[1]==x/10)continue;
			if(~ban[2]&&ban[2]==x%10)continue;
			if(~ban[4]&&ban[4]==y/10)continue;
			if(~ban[5]&&ban[5]==y%10)continue;
			if(~ban[7]&&ban[7]==z/10)continue;
			if(~ban[8]&&ban[8]==z%10)continue;
			memset(e,0,sizeof e);
			e[x/10]++,e[x%10]++,e[y/10]++,e[y%10]++,e[z/10]++,e[z%10]++;
			bool flag=1;
			for(int i=0;i<=9;i++){
				if(vis[i]&&e[i]<cnt[i]){
					flag=0;break;
				}
				if(tag[i]&&e[i]!=cnt[i]){
					flag=0;break;
				}
			}
			if(!flag)continue;
			ans.push_back({x,y,z});
		}
	}
	printf("%d\n",(int)ans.size());
	for(auto x:ans)printf("%02d+%02d=%02d\n",x[0],x[1],x[2]);
	return 0;
}