#include <queue>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
inline void read(int &x){
	x=0;char ch;bool flag = false;
	while(ch=getchar(),ch<'!');if(ch == '-') ch=getchar(),flag = true;
	while(x=10*x+ch-'0',ch=getchar(),ch>'!');if(flag) x=-x;
}
inline int cat_min(const int &a,const int &b){return a<b ? a:b;}
inline int cat_max(const int &a,const int &b){return a>b ? a:b;}
int main(){
	freopen("brainfxxk.in","r",stdin);
	freopen("brainfxxk.out","w",stdout);
	int n;read(n);
	bool flag = false;
	if(n < 0) n = -n,flag = true;
	for(int i=32;i>=1;--i){
		printf("**");
		if(n & (1<<(i-1))){
			if(flag) printf("-");
			else printf("+");
		}
		if(i != 1) printf(">");
	}
	getchar();getchar();
	fclose(stdin);fclose(stdout);
	return 0;
}