/*****************************************
备注：
******************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
void f(int m,int n)
{
	int sum;
	if(m==0)
	{
		return  ;
	} 
	sum=m%2;
	m/=2;
	f(m,n+1);
	if(m!=0&&sum!=0)
		cout<<"+";
	if(sum==1)
	{
		if(n==0)
			cout<<"2(0)";
		else if(n==1)
			cout<<"2";
		else if(n==2)
			cout<<"2(2)";
		else
		{
			cout<<"2(";
			f(n,0);
			cout<<")";
		} 
	} 
}
int main()
{
	int n;
	cin>>n;
	f(n,0); 
	return 0;
}