3652

/*
	应该算个简单题
*/

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>
#include <strstream>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef long long LL;
typedef unsigned long long ULL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define FORi(a,b,c) for(int i=(a);i<(b);i+=c)
#define FORj(a,b,c) for(int j=(a);j<(b);j+=c)
#define FORk(a,b,c) for(int k=(a);k<(b);k+=c)
#define FORp(a,b,c) for(int p=(a);p<(b);p+=c)

#define FF(i,a)    for(int i=0;i<(a);i+++)
#define FFD(i,a)   for(int i=(a)-1;i>=0;i--)
#define Z(a) (a<<1)
#define Y(a) (a>>1)

const double eps = 1e-6;
const double INFf = 1e10;
const int INFi = 1000000000;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}


// code begi
int A,B,C,S;
bool used[65537];
int res[17];
int main()
{
	while(scanf("%d",&A)&&A)
	{
		scanf("%d %d %d",&B,&C,&S);
		memset(used,0,sizeof(used));
		memset(res,0,sizeof(res));
		int cnt = 0;
		while(!used[S])
		{
			cnt ++;
			int tm = S;
			for(int i=16;i>=1;i--)
			{
				res[i] += tm%2;
				tm=Y(tm);
				if(tm==0) break;
			}
			used[S] = true;
			S = (A*S+B)%C;
		}
		for(int i=1;i<=16;i++)
		{
			if(res[i]==0)
				printf("0");
			else if(res[i]==cnt)
			{
				printf("1");
			}
			else
				printf("?");
		}
		printf("\n");
	}
	return 0;
}