/*=========================================*
  * Auther: Riolu
  * Time: 2016.11.8
  * ©Copyright 2016 Riolu. All Rights Reserved.
  *=========================================*/

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
#include<string>
#include<ctime>
#include<cstring>
using namespace std;


typedef long long ll;
typedef double db;
typedef pair<int,int> P;
const int N =2e5+2;
ll  n,m;



int main(){
	
	freopen("brainfxxk.in","r",stdin);
	freopen("brainfxxk.out","w",stdout);

	ll i,j,pos=0;
	cin>>n;
	int a[1000];
	if(n>0){
		i=0;
		printf("+");			//a[pos]++;cout<<pos<<' '<<a[pos]<<endl;
		while(pow(2,i+1)<=n){
			printf(">**");      //pos++;a[pos]+=a[pos-1];a[pos]+=a[pos-1];cout<<pos<<' '<<a[pos]<<endl;
			i++;
		}
		for(j=pow(2,i);j<n;j++)printf("+");
	}else{
		n=-n;
		i=0;
		printf("-");			//a[pos]++;cout<<pos<<' '<<a[pos]<<endl;
		while(pow(2,i+1)<=n){
			printf(">**");      //pos++;a[pos]+=a[pos-1];a[pos]+=a[pos-1];cout<<pos<<' '<<a[pos]<<endl;
			i++;
		}
		for(j=pow(2,i);j<n;j++)printf("-");
	}
	
	
	return 0;
}
/*

*/