//https://leetcode.com/problems/range-sum-query-2d-mutable/
//41  24
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>

#define INF 0x3f3f3f3f
#define INF64 0x3f3f3f3f3f3f3f3f
using namespace std;
long long MOD = 1e9+7;
long long M = 550;
int n, k, p, t0;
string st = "";
int main() {
    cin >> st;
    int ans = 0;
    int current = 0;
    int sign = 1;
    for (int i = 0; i < st.size(); i++) {
        if (st[i] == '+') {
            ans += sign * current;
            sign = 1;
            current = 0;
        } else if (st[i] == '-') {
            ans += sign * current;
            sign = -1;
            current = 0;
        } else {
            current = 10 * current + (st[i] - '0');
        }
    }
    ans += sign * current;
    char ch = '+';
    if (ans < 0) {
        ch = '-';
    }
    for (int i = 0; i < abs(ans); i++) {
        cout << ch;
    }
    cout << "++++++++++++++++++++++++++++++++++++++++++++++++.";
}


#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
#include <set>
#include <map>
#include <fstream>
#include <string>
#include <stack>
#include <deque>
#include <algorithm>
#include <random>
#include <ctime>
#include <sstream>
#include <functional>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sq(x) ((x)*(x))
#define ifthen(x,y,z) ((x)?(y):(z))

using ll = long long;
using ull = unsigned long long;
using intpair = pair<int, int>;
using llpair = pair<ll, ll>;
using ld = long double;
using d = double;
using vint = vector<int>;
using vll = vector<ll>;

struct Edge
{
    int to, w;
};

ll n, m, q;
string s;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll ans = 0;
    ll t;
    char s = '+';
    while (true)
    {
        cin >> t;
        if (s == '+')
            ans += t;
        else
            ans -= t;
        if (!(cin >> s))
            break;
    }

    if (ans == 0)
    {
        cout << "++++++++++++++++++++++++++++++++++++++++++++++++." << endl;
        return 0;
    }

    vector<string> w;
    while (ans)
    {
        string s = "++++++++++++++++++++++++++++++++++++++++++++++++";
        for (int i = 0; i < ans % 10; ++i)
            s += "+";
        s += ".>";
        w.push_back(s);
        ans /= 10;
    }

    for (int i = w.size() - 1; i >= 0; --i)
        cout << w[i] << endl;

    return 0;
}


#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
#include <set>
#include <map>
#include <fstream>
#include <string>
#include <stack>
#include <deque>
#include <algorithm>
#include <random>
#include <ctime>
#include <sstream>
#include <functional>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sq(x) ((x)*(x))
#define ifthen(x,y,z) ((x)?(y):(z))

using ll = long long;
using ull = unsigned long long;
using intpair = pair<int, int>;
using llpair = pair<ll, ll>;
using ld = long double;
using d = double;
using vint = vector<int>;
using vll = vector<ll>;

struct Edge
{
    int to, w;
};

ll n, m, q;
string s;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll ans = 0;
    ll t;
    char s = '+';
    while (true)
    {
        cin >> t;
        if (s == '+')
            ans += t;
        else
            ans -= t;
        ans %= 256;
        if (ans < 0)
            ans += 256;
        if (!(cin >> s))
            break;
    }

    vector<string> w;
    while (ans)
    {
        string s = "++++++++++++++++++++++++++++++++++++++++++++++++";
        for (int i = 0; i < ans % 10; ++i)
            s += "+";
        s += ".>";
        w.push_back(s);
        ans /= 10;
    }

    for (int i = w.size() - 1; i >= 0; --i)
        cout << w[i] << endl;

    return 0;
}


#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
#include <set>
#include <map>
#include <fstream>
#include <string>
#include <stack>
#include <deque>
#include <algorithm>
#include <random>
#include <ctime>
#include <sstream>
#include <functional>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sq(x) ((x)*(x))
#define ifthen(x,y,z) ((x)?(y):(z))

using ll = long long;
using ull = unsigned long long;
using intpair = pair<int, int>;
using llpair = pair<ll, ll>;
using ld = long double;
using d = double;
using vint = vector<int>;
using vll = vector<ll>;

struct Edge
{
    int to, w;
};

ll n, m, q;
string s;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll ans = 0;
    ll t;
    char s = '+';
    while (true)
    {
        cin >> t;
        if (s == '+')
            ans += t;
        else
            ans -= t;
        ans %= 256;
        if (ans < 0)
            ans += 256;
        if (!(cin >> s))
            break;
    }

    for (int i = 0; i < ans; ++i)
        cout << "+";
    cout << "." << endl;

    return 0;
}


#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
#include <set>
#include <map>
#include <fstream>
#include <string>
#include <stack>
#include <deque>
#include <algorithm>
#include <random>
#include <ctime>
#include <sstream>
#include <functional>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sq(x) ((x)*(x))
#define ifthen(x,y,z) ((x)?(y):(z))

using ll = long long;
using ull = unsigned long long;
using intpair = pair<int, int>;
using llpair = pair<ll, ll>;
using ld = long double;
using d = double;
using vint = vector<int>;
using vll = vector<ll>;

struct Edge
{
    int to, w;
};

ll n, m, q;
string s;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll ans = 0;
    ll t;
    char s = '+';
    while (true)
    {
        cin >> t;
        if (s == '+')
            ans += t;
        else
            ans -= t;
        if (!(cin >> s))
            break;
    }

    vector<string> w;
    while (ans)
    {
        string s = "++++++++++++++++++++++++++++++++++++++++++++++++";
        for (int i = 0; i < ans % 10; ++i)
            s += "+";
        s += ".>";
        w.push_back(s);
        ans /= 10;
    }

    for (int i = w.size() - 1; i >= 0; --i)
        cout << w[i] << endl;

    return 0;
}


#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
#include <set>
#include <map>
#include <fstream>
#include <string>
#include <stack>
#include <deque>
#include <algorithm>
#include <random>
#include <ctime>
#include <sstream>
#include <functional>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sq(x) ((x)*(x))
#define ifthen(x,y,z) ((x)?(y):(z))

using ll = long long;
using ull = unsigned long long;
using intpair = pair<int, int>;
using llpair = pair<ll, ll>;
using ld = long double;
using d = double;
using vint = vector<int>;
using vll = vector<ll>;

struct Edge
{
    int to, w;
};

ll n, m, q;
string s;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll ans = 0;
    ll t;
    char s = '+';
    while (true)
    {
        cin >> t;
        if (s == '+')
            ans += t;
        else
            ans -= t;
        ans %= 256;
        if (ans < 0)
            ans += 256;
        if (!(cin >> s))
            break;
    }

    vector<string> w;
    while (ans)
    {
        string s = "++++++++++++++++++++++++++++++++++++++++++++++++";
        for (int i = 0; i < ans % 10; ++i)
            s += "+";
        s += ".";
        w.push_back(s);
        ans /= 10;
    }

    for (int i = w.size() - 1; i >= 0; --i)
        cout << w[i] << endl;

    return 0;
}


#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstring>
#include <set>
#include <map>
#include <fstream>
#include <string>
#include <stack>
#include <deque>
#include <algorithm>
#include <random>
#include <ctime>
#include <sstream>
#include <functional>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sq(x) ((x)*(x))
#define ifthen(x,y,z) ((x)?(y):(z))

using ll = long long;
using ull = unsigned long long;
using intpair = pair<int, int>;
using llpair = pair<ll, ll>;
using ld = long double;
using d = double;
using vint = vector<int>;
using vll = vector<ll>;

struct Edge
{
    int to, w;
};

ll n, m, q;
string s;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll ans = 0;
    ll t;
    char s = '+';
    while (true)
    {
        cin >> t;
        if (s == '+')
            ans += t;
        else
            ans -= t;
        if (!(cin >> s))
            break;
    }

    ans %= 256;

    for (int i = 0; i < ans; ++i)
        cout << "+";
    cout << "." << endl;

    return 0;
}


#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

int MOD = 1e9 + 7; ll INF = 1e18;

int n, a[105];

int solve(){
	string s;
	cin >> s;
	int ans = 0, x = 0, sign = 1;
	for(int i=0;i<s.size();i++){
		if(s[i] == '+'){
			if(sign) ans += x; else ans -= x;
			sign = 1; x = 0;
		}else if(s[i] == '-'){
			if(sign) ans += x; else ans -= x;
			sign = 0; x = 0;
		}else{
			int k = s[i] - '0';
			x = x * 10 + k;
		}
	}
	if(sign) ans += x; else ans -= x;
	cerr << ans << endl;
	string out = "";
	if(!ans){
		for(int i=0;i<'0';i++) cout << '+'; cout << '.' << endl;
		return 0;
	}
	for(;ans;ans/=10){
		string tp = "";
		out += '0' + ans % 10;
	}
	reverse(out.begin(), out.end());
	for(int i=0;i<out[0];i++) cout <<'+'; cout << '.' << endl;
	for(int j=1;j<out.size();j++){
		int x = out[j] - out[j-1];
		if(x > 0)
			for(int i=0;i<x;i++) cout << '+';
		else
			for(int i=0;i<-x;i++) cout << '-';
		cout << '.' << endl;
	}
	return 0;
}

int main(){
	ios::sync_with_stdio(0);
	// int t; cin >> t; while(t--)
	solve();
	// cout << (solve() ? "YES" : "NO") << endl;
	return 0;
}


#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

int MOD = 1e9 + 7; ll INF = 1e18;

int n, a[105];

int solve(){
	string s;
	cin >> s;
	int ans = 0, x = 0, sign = 1;
	for(int i=0;i<s.size();i++){
		if(s[i] == '+'){
			if(sign) ans += x; else ans -= x;
			sign = 1; x = 0;
		}else if(s[i] == '-'){
			if(sign) ans += x; else ans -= x;
			sign = 0; x = 0;
		}else{
			int k = s[i] - '0';
			x = x * 10 + k;
		}
	}
	if(sign) ans += x; else ans -= x;
	cerr << ans << endl;
	string out = "";
	if(!ans){
		cout << '.' << endl;
		return 0;
	}
	for(;ans;ans/=10){
		string tp = "";
		out += '0' + ans % 10;
	}
	reverse(out.begin(), out.end());
	for(int i=0;i<out[0];i++) cout <<'+'; cout << '.' << endl;
	for(int j=1;j<out.size();j++){
		int x = out[j] - out[j-1];
		if(x > 0)
			for(int i=0;i<x;i++) cout << '+';
		else
			for(int i=0;i<-x;i++) cout << '-';
		cout << '.' << endl;
	}
	return 0;
}

int main(){
	ios::sync_with_stdio(0);
	// int t; cin >> t; while(t--)
	solve();
	// cout << (solve() ? "YES" : "NO") << endl;
	return 0;
}


#include "bits/stdc++.h"
using namespace std;

int a[250];
char op[250];
int c = 0;

vector < string > split(string work, char delim, char dd) {
    vector < string > flds;
    if (!flds.empty()) flds.clear();
    string buf = "";
    int i = 0;
    while (i < (int) work.size()) {
        if (work[i] == delim || work[i] == dd) {
            op[c++] = work[i];
        }
        if (work[i] != delim && work[i] != dd) {
            buf += work[i];
        } else if (((int) buf.size()) > 0) {
            flds.push_back(buf);
            buf = "";
        }
        i++;
    }
    if ((int) buf.size()) {
        flds.push_back(buf);
    }
    return flds;
}

int main(){
    string s; cin >> s;
    vector < string > nums = split(s, '+', '-');
    int n = nums.size();
    int sum = stoi(nums[0]);
    for (int i = 1; i < n; i++) {
        a[i] = stoi(nums[i]);
        if (op[i - 1] == '+') {
            sum += a[i];
        } else {
            sum -= a[i];
        }
    }
    for (int i = 1; i <= sum; i++) {
        cout << "+";
    }
    cout << ".";
}


#include<bits/stdc++.h>
using namespace std;
int idx, tmp, ans;
string s;

int main () {
	cin >>s;
	idx = 0;
	tmp = 0;
	ans = 0;
	bool sign = true;
	while (idx < s.size()) {
		if (s[idx] == '+' || s[idx] == '-') {
			if (sign) ans += tmp; else ans -= tmp;
			tmp = 0;
			sign = (s[idx] == '+');
		} else {
			tmp = tmp *10 + s[idx] - '0';
		}
		idx++;
	}
	if (sign) ans += tmp; else ans -= tmp;
	int cur = 0;
	for (int i = 100; i>=1; i/=10){
		if (ans <i && i != 1) continue;
		int want = (ans /i)%10;
		//cout << want << endl;
		if (cur < 48 + want){
			while (cur < 48+want) {
				cur++;
				printf("+");
			}
		}
		if (cur >48 + want){
			while (cur > 48+want) {
				cur--;
				printf("-");
			}
		}
		puts(".");
	}
}


#include<bits/stdc++.h>
using namespace std;
int idx, tmp, ans;
string s;

int main () {
	cin >>s;
	idx = 0;
	tmp = 0;
	ans = 0;
	bool sign = true;
	while (idx < s.size()) {
		if (s[idx] == '+' || s[idx] == '-') {
			if (sign) ans += tmp; else ans -= tmp;
			tmp = 0;
			sign = (s[idx] == '+');
		} else {
			tmp = tmp *10 + s[idx] - '0';
		}
		idx++;
	}
	if (sign) ans += tmp; else ans -= tmp;
	int cur = 0;
	for (int i = 100; i>=1; i/=10){
		if (ans <i && i != 1) continue;
		int want = ans /i;
		if (cur < 48 + want){
			while (cur < 48+want) {
				cur++;
				printf("+");
			}
		}
		if (cur >48 + want){
			while (cur > 48+want) {
				cur--;
				printf("-");
			}
		}
		puts(".");
	}
}


#include <bits/stdc++.h>

using namespace std;

#define dd				double
#define ll 				long long
#define pb 				push_back
#define mp 				make_pair
#define X				first
#define Y				second
#define forn( i, n ) 	for( ll i = 0; i < (ll) (n); i ++ )
#define endl 			'\n'

bool check( char c ) {
	return ( '0' <= c && c <= '9' );
}

int main( void ) {
	string s;
	cin >> s;
	ll i = 0;
	ll y = 1;
	ll res = 0;
	while( i < s.size() ) {
		ll j = i;
		ll x = 0;
		while( j < s.size() && check( s[j] ) ) {
			x *= 10;
			x += s[j] - '0';
			j ++;
		}
		res += y * x;
		if( j < s.size() ) {
			if( s[j] == '+' )
				y = 1;
			else
				y = -1;
		}
		i = j + 1;
	}
	ll idx = 0;
	while( res ) {
		ll x = res % 10;
		res /= 10;
		forn( i, x ) {
			cout << '+';
		}
		cout << '>';
		cout << endl;
		idx ++;
	}
	while( idx ) {
		cout << '<';
		cout << "++++++++++++++++++++++++++++++++++++++++++++++++";
		cout << '.';
		cout << endl;
		idx --;
	}
 	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define dd				double
#define ll 				long long
#define pb 				push_back
#define mp 				make_pair
#define X				first
#define Y				second
#define forn( i, n ) 	for( ll i = 0; i < (ll) (n); i ++ )
#define endl 			'\n'

bool check( char c ) {
	return ( '0' <= c && c <= '9' );
}

int main( void ) {
	string s;
	cin >> s;
	ll i = 0;
	ll y = 1;
	ll res = 0;
	while( i < s.size() ) {
		ll j = i;
		ll x = 0;
		while( j < s.size() && check( s[j] ) ) {
			x *= 10;
			x += s[j] - '0';
			j ++;
		}
		res += y * x;
		if( j < s.size() ) {
			if( s[j] == '+' )
				y = 1;
			else
				y = -1;
		}
		i = j + 1;
	}
	ll idx = 0;
	if( res == 0 ) {
		cout << "++++++++++++++++++++++++++++++++++++++++++++++++";
		cout << '.';
		cout << endl;
		return 0;
	}
	while( res ) {
		ll x = res % 10;
		res /= 10;
		forn( i, x ) {
			cout << '+';
		}
		cout << '>';
		cout << endl;
		idx ++;
	}
	while( idx ) {
		cout << '<';
		cout << "++++++++++++++++++++++++++++++++++++++++++++++++";
		cout << '.';
		cout << endl;
		idx --;
	}
 	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define dd				double
#define ll 				long long
#define pb 				push_back
#define mp 				make_pair
#define X				first
#define Y				second
#define forn( i, n ) 	for( ll i = 0; i < (ll) (n); i ++ )
#define endl 			'\n'

bool check( char c ) {
	return ( '0' <= c && c <= '9' );
}

int main( void ) {
	string s;
	cin >> s;
	ll i = 0;
	ll y = 1;
	ll res = 0;
	while( i < s.size() ) {
		ll j = i;
		ll x = 0;
		while( j < s.size() && check( s[j] ) ) {
			x *= 10;
			x += s[j] - '0';
			j ++;
		}
		res += y * x;
		if( j < s.size() ) {
			if( s[j] == '+' )
				y = 1;
			else
				y = -1;
		}
		i = j + 1;
	}
	cout << "++++++++++++++++++++++++++++++++++++++++++++++++";
	forn( i, res )
		cout << '+';
	cout << '.';
 	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define dd				double
#define ll 				long long
#define pb 				push_back
#define mp 				make_pair
#define X				first
#define Y				second
#define forn( i, n ) 	for( ll i = 0; i < (ll) (n); i ++ )
#define endl 			'\n'

bool check( char c ) {
	return ( '0' <= c && c <= '9' );
}

int main( void ) {
	string s;
	cin >> s;
	ll i = 0;
	ll y = 1;
	ll res = 0;
	while( i < s.size() ) {
		ll j = i;
		ll x = 0;
		while( j < s.size() && check( s[j] ) ) {
			x *= 10;
			x += s[j] - '0';
			j ++;
		}
		res += y * x;
		if( j < s.size() ) {
			if( s[j] == '+' )
				y = 1;
			else
				y = -1;
		}
		i = j + 1;
	}
	forn( i, res )
		cout << '+';
	cout << '.';
 	return 0;
}


#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<char> op;
vector<int> num;
int main(){
    string s;
    cin>>s;
    int num=0,cnt=0,ans=-1;
    for(int i=0;i<s.length();++i){
        if(!isdigit(s[i])){
            if(ans==-1)
                ans=num;
            else{
                if(op[op.size()-1]=='-')
                    ans-=num;
                else
                    ans+=num;
            }
            for(int i=0;i<num;++i)
                printf("+");
            cout<<">\n";
            num=0;
            op.push_back(s[i]);
        }
        else
            num=num*10+s[i]-'0';
    }
    if(op[op.size()-1]=='-')
        ans-=num;
    else
        ans+=num;
    for(int i=0;i<num;++i)
        printf("+");
    cout<<">\n";
    for(int i=0;i<op.size();++i)
        cout<<"<";
    for(int i=0;i<op.size();++i){
        if(i)
            cout<<endl;
        cout<<"[";
        cout<<string(1+i,'<');
        cout<<op[i];
        cout<<string(i+1,'>');
        cout<<"-]";
    }
    for(int i=0;i<op.size();++i)
        cout<<"<";
    cout<<endl;
    if(ans>=100){
        int tmp=ans/100;
        for(int i=tmp+'0';i<=ans;++i)
            cout<<"+";
        cout<<'.';
        ans%=100;
        if(ans/10>=tmp){
            for(int i=ans/10;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans/10;++i)
                cout<<'-';
            cout<<'.';
        }
        tmp=ans/10;
        ans%=10;
        if(ans>=tmp){
            for(int i=ans;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
    }
    else if(ans>=10){
            int tmp=ans/10;
        if(tmp+'0'>=ans){
            for(int i=ans;i<tmp+'0';++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp+'0';i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
        tmp=ans/10;
        ans%=10;
        if(ans>=tmp){
            for(int i=ans;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
    }
    else{
        for(int i=0;i<'0';++i)
            cout<<'+';
        cout<<'.';
    }
    cout<<endl;
}


#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<char> op;
vector<int> num;
int main(){
    string s;
    cin>>s;
    int num=0,cnt=0,ans=-1;
    for(int i=0;i<s.length();++i){
        if(!isdigit(s[i])){
            if(ans==-1)
                ans=num;
            else{
                if(s[i]=='-')
                    ans-=num;
                else
                    ans+=num;
            }
            for(int i=0;i<num;++i)
                printf("+");
            cout<<">\n";
            num=0;
            op.push_back(s[i]);
        }
        else
            num=num*10+s[i]-'0';
    }
    for(int i=0;i<num;++i)
        printf("+");
    cout<<">\n";
    for(int i=0;i<op.size();++i)
        cout<<"<";
    for(int i=0;i<op.size();++i){
        if(i)
            cout<<endl;
        cout<<"[";
        cout<<string(1+i,'<');
        cout<<op[i];
        cout<<string(i+1,'>');
        cout<<"-]";
    }
    for(int i=0;i<op.size();++i)
        cout<<"<";
    cout<<endl;
    if(ans>=100){
        int tmp=ans/100;
        for(int i=tmp+'0';i<=ans;++i)
            cout<<"+";
        cout<<'.';
        ans%=100;
        if(ans/10>=tmp){
            for(int i=ans/10;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans/10;++i)
                cout<<'-';
            cout<<'.';
        }
        tmp=ans/10;
        ans%=10;
        if(ans>=tmp){
            for(int i=ans;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
    }
    else if(ans>=10){
            int tmp=ans/10;
        if(tmp+'0'>=ans){
            for(int i=ans;i<tmp+'0';++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp+'0';i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
        tmp=ans/10;
        ans%=10;
        if(ans>=tmp){
            for(int i=ans;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
    }
    else{
        for(int i=0;i<'0';++i)
            cout<<'+';
        cout<<'.';
    }
    cout<<endl;
}


#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<char> op;
vector<int> num;
int main(){
    string s;
    cin>>s;
    int num=0,cnt=0,ans=-1;
    for(int i=0;i<s.length();++i){
        if(!isdigit(s[i])){
            if(ans==-1)
                ans=num;
            else{
                if(op[op.size()-1]=='-')
                    ans-=num;
                else
                    ans+=num;
            }
            num=0;
            op.push_back(s[i]);
        }
        else
            num=num*10+s[i]-'0';
    }
    if(op[op.size()-1]=='-')
        ans-=num;
    else
        ans+=num;
    if(ans>=100){
        int tmp=ans/100;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<".>\n";
        ans%=100;
        tmp=ans/10;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<".>\n";
        ans%=10;
        for(int i=0;i<=ans+'0';++i)
            cout<<"+";
        cout<<".\n";
    }
    else if(ans>=10){
        int tmp=ans/10;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<".>\n";
        ans%=10;
        for(int i=0;i<=ans+'0';++i)
            cout<<"+";
        cout<<".\n";
    }
    else{
        for(int i=0;i<ans+'0';++i)
            cout<<'+';
        cout<<".\n";
    }
    cout<<endl;
}


#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<char> op;
vector<int> num;
int main(){
    string s;
    cin>>s;
    int num=0,cnt=0,ans=-1;
    for(int i=0;i<s.length();++i){
        if(!isdigit(s[i])){
            if(ans==-1)
                ans=num;
            else{
                if(op[op.size()-1]=='-')
                    ans-=num;
                else
                    ans+=num;
            }
            for(int i=0;i<num;++i)
                printf("+");
            cout<<">\n";
            num=0;
            op.push_back(s[i]);
        }
        else
            num=num*10+s[i]-'0';
    }
    if(op[op.size()-1]=='-')
        ans-=num;
    else
        ans+=num;
    for(int i=0;i<num;++i)
        printf("+");
    cout<<">\n";
    for(int i=0;i<op.size();++i)
        cout<<"<";
    for(int i=0;i<op.size();++i){
        if(i)
            cout<<">\n";
        cout<<"[";
        cout<<string(1+i,'<');
        cout<<op[i];
        cout<<string(i+1,'>');
        cout<<"-]";
    }
    for(int i=0;i<op.size();++i)
        cout<<"<";
    cout<<endl;
    if(ans>=100){
        int tmp=ans/100;
        for(int i=tmp+'0';i<=ans;++i)
            cout<<"+";
        cout<<'.';
        ans%=100;
        if(ans/10>=tmp){
            for(int i=ans/10;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans/10;++i)
                cout<<'-';
            cout<<'.';
        }
        tmp=ans/10;
        ans%=10;
        if(ans>=tmp){
            for(int i=ans;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
    }
    else if(ans>=10){
            int tmp=ans/10;
        if(tmp+'0'>=ans){
            for(int i=ans;i<tmp+'0';++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp+'0';i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
        tmp=ans/10;
        ans%=10;
        if(ans>=tmp){
            for(int i=ans;i<tmp;++i)
                cout<<'+';
            cout<<'.';
        }
        else{
            for(int i=tmp;i<ans;++i)
                cout<<'-';
            cout<<'.';
        }
    }
    else{
        for(int i=0;i<'0';++i)
            cout<<'+';
        cout<<'.';
    }
    cout<<endl;
}


#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<char> op;
vector<int> num;
int main(){
    string s;
    cin>>s;
    int num=0,cnt=0,ans=-1;
    for(int i=0;i<s.length();++i){
        if(!isdigit(s[i])){
            if(ans==-1)
                ans=num;
            else{
                if(op[op.size()-1]=='-')
                    ans-=num;
                else
                    ans+=num;
            }
            num=0;
            op.push_back(s[i]);
        }
        else
            num=num*10+s[i]-'0';
    }
    if(op[op.size()-1]=='-')
        ans-=num;
    else
        ans+=num;
    if(ans>=100){
        int tmp=ans/100;
        for(int i=0;i<tmp+'0';++i)
            cout<<"+";
        cout<<".>\n";
        ans%=100;
        tmp=ans/10;
        for(int i=0;i<tmp+'0';++i)
            cout<<"+";
        cout<<".>\n";
        ans%=10;
        for(int i=0;i<ans+'0';++i)
            cout<<"+";
        cout<<".\n";
    }
    else if(ans>=10){
        int tmp=ans/10;
        for(int i=0;i<tmp+'0';++i)
            cout<<"+";
        cout<<".>\n";
        ans%=10;
        for(int i=0;i<ans+'0';++i)
            cout<<"+";
        cout<<".\n";
    }
    else{
        for(int i=0;i<ans+'0';++i)
            cout<<'+';
        cout<<".\n";
    }
    cout<<endl;
}


#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<char> op;
vector<int> num;
int main(){
    string s;
    cin>>s;
    int num=0,cnt=0,ans=-1;
    for(int i=0;i<s.length();++i){
        if(!isdigit(s[i])){
            if(ans==-1)
                ans=num;
            else{
                if(op[op.size()-1]=='-')
                    ans-=num;
                else
                    ans+=num;
            }
            num=0;
            op.push_back(s[i]);
        }
        else
            num=num*10+s[i]-'0';
    }
    if(op[op.size()-1]=='-')
        ans-=num;
    else
        ans+=num;
    if(ans>=100){
        int tmp=ans/100;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<".\n";
        ans%=100;
        tmp=ans/10;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<".\n";
        ans%=10;
        for(int i=0;i<=ans+'0';++i)
            cout<<"+";
        cout<<".\n";
    }
    else if(ans>=10){
        int tmp=ans/10;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<".>\n";
        ans%=10;
        for(int i=0;i<=ans+'0';++i)
            cout<<"+";
        cout<<".\n";
    }
    else{
        for(int i=0;i<ans+'0';++i)
            cout<<'+';
        cout<<".\n";
    }
    cout<<endl;
}


#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector<char> op;
vector<int> num;
int main(){
    string s;
    cin>>s;
    int num=0,cnt=0,ans=-1;
    for(int i=0;i<s.length();++i){
        if(!isdigit(s[i])){
            if(ans==-1)
                ans=num;
            else{
                if(op[op.size()-1]=='-')
                    ans-=num;
                else
                    ans+=num;
            }
            num=0;
            op.push_back(s[i]);
        }
        else
            num=num*10+s[i]-'0';
    }
    if(op[op.size()-1]=='-')
        ans-=num;
    else
        ans+=num;
    if(ans>=100){
        int tmp=ans/100;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<'.>\n';
        ans%=100;
        tmp=ans/10;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<'.>\n';
        ans%=10;
        for(int i=0;i<=ans+'0';++i)
            cout<<"+";
        cout<<'.\n';
    }
    else if(ans>=10){
        int tmp=ans/10;
        for(int i=0;i<=tmp+'0';++i)
            cout<<"+";
        cout<<'.>\n';
        ans%=10;
        for(int i=0;i<=ans+'0';++i)
            cout<<"+";
        cout<<'.\n';
    }
    else{
        for(int i=0;i<'0';++i)
            cout<<'+';
        cout<<'.\n';
    }
    cout<<endl;
}


#include<bits/stdc++.h>

#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pdd pair<double,double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#define rep(i,n) for( int i = 0; i < n; ++i )
#define repi(i,n) for( int i = 1 ; i <= n; ++i )
#define repn(i,n) for( int i = n - 1 ; i >= 0 ; --i )
#define repf(j,i,n) for( int j = i ; j < n ; ++j )
#define die(s) {std::cout << s << nl;}
#define dier(s) {std::cout << s; return 0;}
#define vi vector<int>
typedef long long ll;

using namespace std;

vector<string> bf(10);

void fill(){
	rep(i , 10){
		int cur = '0' + i;
		rep(j , cur){
			bf[i] += "+";
		}
		bf[i] += '.';
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.precision(0);
	fill();
	string s;
	cin >> s;
	s += ' ';
	int n = sz(s);
	vector<string> num;
	vector<char> op;
	string cur = "";
	rep(i , n){
		if(s[i] == ' '){
			num.pb(cur);
			break;
		}
		if(s[i] != '+' && s[i] != '-'){
			cur += s[i];
		}else{
			num.pb(cur);
			op.pb(s[i]);
			cur = "";
		}
	}
	int cop = 0;
	vi a(sz(num));
	rep(i , sz(num))a[i] = stoi(num[i]);
	rep(i , sz(a) - 1){
		int f = a[i];
		int s = a[i + 1];
		int ans = 0;
		if(op[cop] == '+'){
			ans = f + s;//((f % 256) + (s % 256)) % 256;
		}else{
			ans = f - s;//((f % 256) - (s % 256)) % 256;
		}
		a[i + 1] = ans;
		++cop;
	}
	int res = a[sz(a) - 1];// % 256;
	string res2 = to_string(res);
	rep(i , sz(res2)){
		cout << bf[res2[i] - '0'] << nl;
		cout << ">" << nl;
	}
	return 0;
}


#include<bits/stdc++.h>

#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pdd pair<double,double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#define rep(i,n) for( int i = 0; i < n; ++i )
#define repi(i,n) for( int i = 1 ; i <= n; ++i )
#define repn(i,n) for( int i = n - 1 ; i >= 0 ; --i )
#define repf(j,i,n) for( int j = i ; j < n ; ++j )
#define die(s) {std::cout << s << nl;}
#define dier(s) {std::cout << s; return 0;}
#define vi vector<int>
typedef long long ll;

using namespace std;

vector<string> bf(10);

void fill(){
	rep(i , 10){
		int cur = '0' + i;
		rep(j , cur){
			bf[i] += "+";
		}
		bf[i] += '.';
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.precision(0);
	fill();
	string s;
	cin >> s;
	s += ' ';
	int n = sz(s);
	vector<string> num;
	vector<char> op;
	string cur = "";
	rep(i , n){
		if(s[i] == ' '){
			num.pb(cur);
			break;
		}
		if(s[i] != '+' && s[i] != '-'){
			cur += s[i];
		}else{
			num.pb(cur);
			op.pb(s[i]);
			cur = "";
		}
	}
	int cop = 0;
	vi a(sz(num));
	rep(i , sz(num))a[i] = stoi(num[i]);
	rep(i , sz(a) - 1){
		int f = a[i];
		int s = a[i + 1];
		int ans = 0;
		if(op[cop] == '+'){
			ans = ((f % 256) + (s % 256)) % 256;
		}else{
			ans = ((f % 256) - (s % 256)) % 256;
		}
		a[i + 1] = ans;
		++cop;
	}
	int res = a[sz(a) - 1] % 256;
	string res2 = to_string(res);
	rep(i , sz(res2)){
		cout << bf[res2[i] - '0'] << nl;
		cout << ">" << nl;
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main () {
    int n = -1, s = 2551;
    char op;
    while (cin >> n) {
        if (s == 2551) {
            s = n;
        } else {
            if (op == '-') {
                s -= n;
            } else {
                s += n;
            }
        }
        cin >> op;
    }
    vector<int> d;
    while (true) {
        d.push_back (s % 10);
        if ((s /= 10) == 0) {
            break;
        }
    }
    reverse (d.begin (), d.end ());
    for (int i = 0; i < d.size (); i++) {
        for (int j = 0; j < int ('0') + d[i]; j++) {
            cout << "+";
        }
        cout << ".";
        if (i < (int) d.size () - 1) {
            for (int j = 0; j < int ('0') + d[i]; j++) {
                cout << "-";
            }
        }
    }
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main () {
    int n = -1, s = 2551;
    char op;
    while (cin >> n) {
        if (s == 2551) {
            s = n;
        } else {
            if (op == '-') {
                s -= n;
            } else {
                s += n;
            }
        }
        cin >> op;
    }
    for (int i = 0; i < s; i++) {
        cout << "+";
    }
    cout << ".";
    return 0;
}


/*input
9-7
*/
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <vector>

using namespace std;

int main () {

	int x;
	cin >> x;
	int y;
	char z;
	while(cin >> z >> y){
		if(z=='+')
			x+=y;
		else
			x-=y;
	}
	cout << x << endl;
	vector<int> sk;
	while(x>0){
		sk.push_back(x%10);
		x/=10;
	}
	for(int i = sk.size()-1;i>=0;i--){
		for(int j = 0;j<sk[i];j++){
			cout << '+';
		}
		cout << "++++++++++++++++++++++++++++++++++++++++++++++++.>\n";
	}

	return 0;
}


/*input
9-7
*/
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>

using namespace std;

int main () {

	int x;
	cin >> x;
	int y;
	char z;
	while(cin >> z >> y){
		if(z=='+')
			x+=y;
		else
			x-=y;
	}
	cout << x << endl;
	vector<int> sk;
	while(x>0){
		sk.push_back(x%10);
		x/=10;
	}
	for(int i = sk.size()-1;i>=0;i--){
		for(int j = 0;j<sk[i];j++){
			cout << '+';
		}
		cout << "++++++++++++++++++++++++++++++++++++++++++++++++.\n";
	}

	return 0;
}


/*input
9-7
*/
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <vector>

using namespace std;

int main () {

	int x;
	cin >> x;
	int y;
	char z;
	while(cin >> z >> y){
		if(z=='+')
			x+=y;
		else
			x-=y;
	}
	cout << x << endl;
	vector<int> sk;
	while(x>0){
		sk.push_back(x%10);
		x/=10;
	}
	for(int i = sk.size()-1;i>=0;i--){
		for(int j = 0;j<sk[i];j++){
			cout << '+';
		}
		cout << "++++++++++++++++++++++++++++++++++++++++++++++++.\n";
	}

	return 0;
}


/*input
9-7+7+7-7
*/
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <vector>

using namespace std;

int main () {

	long long x;
	cin >> x;
	long long y;
	char z;

	while (cin >> z >> y) {
		if (z == '+')
			x += y;
		else
			x -= y;
	}
	vector<int> sk;

	while (x > 0) {
		sk.push_back(x % 10);
		x /= 10;
	}

	for (int i = sk.size() - 1; i >= 0; i--) {
		for (int j = 0; j < sk[i]; j++)
			cout << '+';

		cout << "++++++++++++++++++++++++++++++++++++++++++++++++.>\n";
	}

	return 0;
}


#include <bits/stdc++.h>

#define LOCAL 0

#define lli long long int
#define llu unsigned long long int
#define ld long double
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define si(n) scanf("%d",&n)
#define slli(n) scanf("%lld",&n);
#define ss(n) scanf("%s",n);

const long double EPS = 1e-10;
const int MOD = 1000000007ll;
const int mod1 = 1000000009ll;
const int mod2 = 1100000009ll;
int INF = (int)1e9;
lli INFINF = (lli)1e18;
int debug = 0;
long double PI = acos(-1.0);

using namespace std;

int bit_count(lli _x){lli _ret=0;while(_x){if(_x%2==1)_ret++;_x/=2;}return _ret;}
int bit(lli _mask,int _i){return (_mask&(1ll<<_i))==0?0:1;}
int add(int a,int b,int m=MOD){int x=a+b;while(x>=m)x-=m;while(x<0)x+=m;return x;}
int sub(int a,int b,int m=MOD){int x=a-b;while(x<0)x+=m;while(x>=m)x-=m;return x;}
int mul(int a,int b,int m=MOD){lli x=a*1ll*b;x%=m;while(x<0)x+=m;return (int)x;}
int ldtoint(ld x){return (int)(x+0.5);}lli ldtolli(ld x){return (lli)(x+0.5);}
int powermod(lli _a,lli _b,int _m=MOD){lli _r=1;while(_b){if(_b%2==1)_r=mul(_r,_a,_m);_b>>=1;_a=mul(_a,_a,_m);}return _r;}

template<class T1,class T2>ostream&operator<<(ostream& os,const pair<T1,T2>&p){os<<"["<<p.first<<","<<p.second<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,const vector<T>&v){os << "[";bool first=true;for (T it:v){if (!first)os<<", ";first = false;os<<it;}os<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,set<T>&v){os<<"[";bool first=true;for (T it:v){if(!first)os<<", ";first=false;os<<it;}os<<"]";return os;}
template<class T1,class T2>ostream&operator<<(ostream& os,map<T1,T2>&v){os<<"[";bool first=true;for(pair<T1,T2> it:v){if(!first)os<<", ";first=false;os<<"("<<it.F<<","<<it.S<<")";}os<<"]";return os;}
template<class T>void parr(T a[],int s,int e){cout<<"[";for(int i=s;i<e;i++)cout<<a[i]<<", ";cout<<a[e]<<"]\n";}

string s;

int main()
{
if(LOCAL){
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    debug = 1;
}
    srand (time(NULL));
    //ios::sync_with_stdio(0);cin.tie(0);

    cin>>s;
    int ans = 0,x = 0;
    int m = 1;
    for(char c:s){
        if(c == '+'){
            ans += m*x;
            m = 1;
            x = 0;
        }
        else if(c == '-'){
            ans += m*x;
            m = -1;
            x = 0;
        }
        else{
            x = 10*x + (c-'0');
        }
        //cout<<m<<" "<<x<<" "<<ans<<"\n";
    }
    ans += m*x;
    int cnt = 0;
    while(ans){
        int y =ans%10;
        for(int i=1;i<=y+'0';i++)cout<<"+";cout<<">";
        ans/=10;
        cnt++;
    }
    while(cnt--){
        cout<<"<.";
    }

    return 0;
}


#include <bits/stdc++.h>

#define LOCAL 0

#define lli long long int
#define llu unsigned long long int
#define ld long double
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define si(n) scanf("%d",&n)
#define slli(n) scanf("%lld",&n);
#define ss(n) scanf("%s",n);

const long double EPS = 1e-10;
const int MOD = 1000000007ll;
const int mod1 = 1000000009ll;
const int mod2 = 1100000009ll;
int INF = (int)1e9;
lli INFINF = (lli)1e18;
int debug = 0;
long double PI = acos(-1.0);

using namespace std;

int bit_count(lli _x){lli _ret=0;while(_x){if(_x%2==1)_ret++;_x/=2;}return _ret;}
int bit(lli _mask,int _i){return (_mask&(1ll<<_i))==0?0:1;}
int add(int a,int b,int m=MOD){int x=a+b;while(x>=m)x-=m;while(x<0)x+=m;return x;}
int sub(int a,int b,int m=MOD){int x=a-b;while(x<0)x+=m;while(x>=m)x-=m;return x;}
int mul(int a,int b,int m=MOD){lli x=a*1ll*b;x%=m;while(x<0)x+=m;return (int)x;}
int ldtoint(ld x){return (int)(x+0.5);}lli ldtolli(ld x){return (lli)(x+0.5);}
int powermod(lli _a,lli _b,int _m=MOD){lli _r=1;while(_b){if(_b%2==1)_r=mul(_r,_a,_m);_b>>=1;_a=mul(_a,_a,_m);}return _r;}

template<class T1,class T2>ostream&operator<<(ostream& os,const pair<T1,T2>&p){os<<"["<<p.first<<","<<p.second<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,const vector<T>&v){os << "[";bool first=true;for (T it:v){if (!first)os<<", ";first = false;os<<it;}os<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,set<T>&v){os<<"[";bool first=true;for (T it:v){if(!first)os<<", ";first=false;os<<it;}os<<"]";return os;}
template<class T1,class T2>ostream&operator<<(ostream& os,map<T1,T2>&v){os<<"[";bool first=true;for(pair<T1,T2> it:v){if(!first)os<<", ";first=false;os<<"("<<it.F<<","<<it.S<<")";}os<<"]";return os;}
template<class T>void parr(T a[],int s,int e){cout<<"[";for(int i=s;i<e;i++)cout<<a[i]<<", ";cout<<a[e]<<"]\n";}

string s;

int main()
{
if(LOCAL){
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    debug = 1;
}
    srand (time(NULL));
    //ios::sync_with_stdio(0);cin.tie(0);

    cin>>s;
    int ans = 0,x = 0;
    int m = 1;
    for(char c:s){
        if(c == '+'){
            ans += m*x;
            m = 1;
            x = 0;
        }
        else if(c == '-'){
            ans += m*x;
            m = -1;
            x = 0;
        }
        else{
            x = 10*x + (c-'0');
        }
        //cout<<m<<" "<<x<<" "<<ans<<"\n";
    }
    ans += m*x;
    int cnt = 0;

    if(ans == 0){
        for(int i=1;i<='0';i++)cout<<"+";cout<<".";
        return 0;
    }

    while(ans){
        int y =ans%10;
        for(int i=1;i<=y+'0';i++)cout<<"+";cout<<">";
        ans/=10;
        cnt++;
    }
    while(cnt--){
        cout<<"<.";
    }

    return 0;
}


#include <bits/stdc++.h>

#define LOCAL 0

#define lli long long int
#define llu unsigned long long int
#define ld long double
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define si(n) scanf("%d",&n)
#define slli(n) scanf("%lld",&n);
#define ss(n) scanf("%s",n);

const long double EPS = 1e-10;
const int MOD = 1000000007ll;
const int mod1 = 1000000009ll;
const int mod2 = 1100000009ll;
int INF = (int)1e9;
lli INFINF = (lli)1e18;
int debug = 0;
long double PI = acos(-1.0);

using namespace std;

int bit_count(lli _x){lli _ret=0;while(_x){if(_x%2==1)_ret++;_x/=2;}return _ret;}
int bit(lli _mask,int _i){return (_mask&(1ll<<_i))==0?0:1;}
int add(int a,int b,int m=MOD){int x=a+b;while(x>=m)x-=m;while(x<0)x+=m;return x;}
int sub(int a,int b,int m=MOD){int x=a-b;while(x<0)x+=m;while(x>=m)x-=m;return x;}
int mul(int a,int b,int m=MOD){lli x=a*1ll*b;x%=m;while(x<0)x+=m;return (int)x;}
int ldtoint(ld x){return (int)(x+0.5);}lli ldtolli(ld x){return (lli)(x+0.5);}
int powermod(lli _a,lli _b,int _m=MOD){lli _r=1;while(_b){if(_b%2==1)_r=mul(_r,_a,_m);_b>>=1;_a=mul(_a,_a,_m);}return _r;}

template<class T1,class T2>ostream&operator<<(ostream& os,const pair<T1,T2>&p){os<<"["<<p.first<<","<<p.second<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,const vector<T>&v){os << "[";bool first=true;for (T it:v){if (!first)os<<", ";first = false;os<<it;}os<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,set<T>&v){os<<"[";bool first=true;for (T it:v){if(!first)os<<", ";first=false;os<<it;}os<<"]";return os;}
template<class T1,class T2>ostream&operator<<(ostream& os,map<T1,T2>&v){os<<"[";bool first=true;for(pair<T1,T2> it:v){if(!first)os<<", ";first=false;os<<"("<<it.F<<","<<it.S<<")";}os<<"]";return os;}
template<class T>void parr(T a[],int s,int e){cout<<"[";for(int i=s;i<e;i++)cout<<a[i]<<", ";cout<<a[e]<<"]\n";}

string s;

int main()
{
if(LOCAL){
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    debug = 1;
}
    srand (time(NULL));
    //ios::sync_with_stdio(0);cin.tie(0);

    cin>>s;
    int ans = 0,x = 0;
    int m = 1;
    for(char c:s){
        if(c == '+'){
            ans += m*x;
            m = 1;
            x = 0;
        }
        else if(c == '-'){
            ans += m*x;
            m = -1;
            x = 0;
        }
        else{
            x = 10*x + (c-'0');
        }
        //cout<<m<<" "<<x<<" "<<ans<<"\n";
    }
    ans += m*x;
    for(int i=1;i<=ans;i++)cout<<'+';cout<<'.';cout<<"\n";

    return 0;
}


#include <bits/stdc++.h>

#define LOCAL 0

#define lli long long int
#define llu unsigned long long int
#define ld long double
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define si(n) scanf("%d",&n)
#define slli(n) scanf("%lld",&n);
#define ss(n) scanf("%s",n);

const long double EPS = 1e-10;
const int MOD = 1000000007ll;
const int mod1 = 1000000009ll;
const int mod2 = 1100000009ll;
int INF = (int)1e9;
lli INFINF = (lli)1e18;
int debug = 0;
long double PI = acos(-1.0);

using namespace std;

int bit_count(lli _x){lli _ret=0;while(_x){if(_x%2==1)_ret++;_x/=2;}return _ret;}
int bit(lli _mask,int _i){return (_mask&(1ll<<_i))==0?0:1;}
int add(int a,int b,int m=MOD){int x=a+b;while(x>=m)x-=m;while(x<0)x+=m;return x;}
int sub(int a,int b,int m=MOD){int x=a-b;while(x<0)x+=m;while(x>=m)x-=m;return x;}
int mul(int a,int b,int m=MOD){lli x=a*1ll*b;x%=m;while(x<0)x+=m;return (int)x;}
int ldtoint(ld x){return (int)(x+0.5);}lli ldtolli(ld x){return (lli)(x+0.5);}
int powermod(lli _a,lli _b,int _m=MOD){lli _r=1;while(_b){if(_b%2==1)_r=mul(_r,_a,_m);_b>>=1;_a=mul(_a,_a,_m);}return _r;}

template<class T1,class T2>ostream&operator<<(ostream& os,const pair<T1,T2>&p){os<<"["<<p.first<<","<<p.second<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,const vector<T>&v){os << "[";bool first=true;for (T it:v){if (!first)os<<", ";first = false;os<<it;}os<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,set<T>&v){os<<"[";bool first=true;for (T it:v){if(!first)os<<", ";first=false;os<<it;}os<<"]";return os;}
template<class T1,class T2>ostream&operator<<(ostream& os,map<T1,T2>&v){os<<"[";bool first=true;for(pair<T1,T2> it:v){if(!first)os<<", ";first=false;os<<"("<<it.F<<","<<it.S<<")";}os<<"]";return os;}
template<class T>void parr(T a[],int s,int e){cout<<"[";for(int i=s;i<e;i++)cout<<a[i]<<", ";cout<<a[e]<<"]\n";}

string s;

int main()
{
if(LOCAL){
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    debug = 1;
}
    srand (time(NULL));
    //ios::sync_with_stdio(0);cin.tie(0);

    cin>>s;
    int ans = 0,x = 0;
    int m = 1;
    for(char c:s){
        if(c == '+'){
            ans += m*x;
            m = 1;
            x = 0;
        }
        else if(c == '-'){
            ans += m*x;
            m = -1;
            x = 0;
        }
        else{
            x = 10*x + (c-'0');
        }
        //cout<<m<<" "<<x<<" "<<ans<<"\n";
    }
    ans += m*x;
    for(int i=1;i<=ans;i++)cout<<'+';cout<<'.';

    return 0;
}


#include <bits/stdc++.h>

#define LOCAL 0

#define lli long long int
#define llu unsigned long long int
#define ld long double
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define si(n) scanf("%d",&n)
#define slli(n) scanf("%lld",&n);
#define ss(n) scanf("%s",n);

const long double EPS = 1e-10;
const int MOD = 1000000007ll;
const int mod1 = 1000000009ll;
const int mod2 = 1100000009ll;
int INF = (int)1e9;
lli INFINF = (lli)1e18;
int debug = 0;
long double PI = acos(-1.0);

using namespace std;

int bit_count(lli _x){lli _ret=0;while(_x){if(_x%2==1)_ret++;_x/=2;}return _ret;}
int bit(lli _mask,int _i){return (_mask&(1ll<<_i))==0?0:1;}
int add(int a,int b,int m=MOD){int x=a+b;while(x>=m)x-=m;while(x<0)x+=m;return x;}
int sub(int a,int b,int m=MOD){int x=a-b;while(x<0)x+=m;while(x>=m)x-=m;return x;}
int mul(int a,int b,int m=MOD){lli x=a*1ll*b;x%=m;while(x<0)x+=m;return (int)x;}
int ldtoint(ld x){return (int)(x+0.5);}lli ldtolli(ld x){return (lli)(x+0.5);}
int powermod(lli _a,lli _b,int _m=MOD){lli _r=1;while(_b){if(_b%2==1)_r=mul(_r,_a,_m);_b>>=1;_a=mul(_a,_a,_m);}return _r;}

template<class T1,class T2>ostream&operator<<(ostream& os,const pair<T1,T2>&p){os<<"["<<p.first<<","<<p.second<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,const vector<T>&v){os << "[";bool first=true;for (T it:v){if (!first)os<<", ";first = false;os<<it;}os<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,set<T>&v){os<<"[";bool first=true;for (T it:v){if(!first)os<<", ";first=false;os<<it;}os<<"]";return os;}
template<class T1,class T2>ostream&operator<<(ostream& os,map<T1,T2>&v){os<<"[";bool first=true;for(pair<T1,T2> it:v){if(!first)os<<", ";first=false;os<<"("<<it.F<<","<<it.S<<")";}os<<"]";return os;}
template<class T>void parr(T a[],int s,int e){cout<<"[";for(int i=s;i<e;i++)cout<<a[i]<<", ";cout<<a[e]<<"]\n";}

string s;

int main()
{
if(LOCAL){
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    debug = 1;
}
    srand (time(NULL));
    //ios::sync_with_stdio(0);cin.tie(0);

    cin>>s;
    int ans = 0,x = 0;
    int m = 1;
    for(char c:s){
        if(c == '+'){
            ans += m*x;
            m = 1;
            x = 0;
        }
        else if(c == '-'){
            ans += m*x;
            m = -1;
            x = 0;
        }
        else{
            x = 10*x + (c-'0');
        }
        //cout<<m<<" "<<x<<" "<<ans<<"\n";
    }
    ans += m*x;
    for(int i=1;i<=ans+'0';i++)cout<<'+';cout<<'.';cout<<"\n";

    return 0;
}


#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>

using namespace std;

vector<int> a;

int main()
{
    int n, i, j, s;
    cin >> n;
    s = clock();
    a.resize(n);
    for (i = 0; i < n; i++)
        cin >> a[i];
    while (clock() - s < 1500)
        i++;
    sort(a.begin(), a.end());
    for (i = 0; i < n; i++)
        cout << a[i] << " ";
    return 0;
}


#include <iostream>
#include <string>
#include <fstream>
#include <vector>

using namespace std;

string s;
vector<int> digits;

int main()
{
    //ofstream cout("input.txt");
    int i, ans = 0, cur = 0;
    bool g = false;
    cin >> s;
    for (i = 0; i < s.length(); i++)
    {
        if (s[i] == '+' || s[i] == '-')
        {
            if (g)
                ans -= cur;
            else
                ans += cur;
            cur = 0;
            if (s[i] == '+')
                g = false;
            else
                g = true;
        }
        else
        {
            cur *= 10;
            cur += s[i] - '0';
        }
    }
    if (g)
        ans -= cur;
    else
        ans += cur;
    if (ans == 0)
        digits.push_back(0);
    while(ans != 0)
    {
        digits.push_back(ans%10);
        ans /= 10;
    }
    int j = 0;
    for (i = digits.size()-1; i >= 0; i--)
    {
        while (j != digits[i] + '0')
        {
            if (digits[i] + '0' < j)
            {
                j--;
                cout << '-';
            }
            else
            {
                j++;
                cout << '+';
            }
        }
        cout << '.' << endl;
    }
    return 0;
}


//by 信冯哥
#include<math.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#include<vector>
#include<queue>
#include<sstream>
#include<set>
#include<limits.h>
#include<time.h>
using namespace std;
typedef int _int;
//#define int long long
const int maxn=(int)1e3+5;
#define MOD 1000000007
#define beginn puts("begin")
#define endd puts("end")
#define orz puts("")

int n,m,k,l,s,t,r,T,ans,cas;
string p;
char f;
vector<int>a;
_int main()
{
	int i,j;
	cin>>p;

	l=p.length();
	for(i=0; i<l; i++)
		if(p[i]<'0'||p[i]>'9')
			f=p[i],p[i]=' ';
	stringstream ss(p);
	ss>>n>>m;
	if(f=='-')
		ans=n-m;
	else ans=m+n;
	if(ans==0)
		{
			printf("+>\n");
			printf("+>\n");
			printf("<[<->-]<");
			printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
			return 0;
		}
	while(ans)
		a.push_back(ans%10),ans/=10;
	for(i=a.size()-1; i>=0; i--)
		{
			if(a[i]==0)
				if(ans==0)
					{
						printf("+>\n");
						printf("+>\n");
						printf("<[<->-]<");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
						continue;
					}
			int t=a[i]-1;
			for(j=1;j<=t;j++)
				printf("+");
			printf(">\n");
			printf("+>\n");
						printf("<[<+>-]<");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
			if(i!=0)
				printf("\n");
		}

	return 0;
}


//by 信冯哥
#include<math.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#include<vector>
#include<queue>
#include<sstream>
#include<set>
#include<limits.h>
#include<time.h>
using namespace std;
typedef int _int;
//#define int long long
const int maxn=(int)1e3+5;
#define MOD 1000000007
#define beginn puts("begin")
#define endd puts("end")
#define orz puts("")

int n,m,k,l,s,t,r,T,ans,cas;
string p;
char f;
vector<int>a;
_int main()
{
	int i,j;
	cin>>p;

	l=p.length();
	for(i=0; i<l; i++)
		if(p[i]<'0'||p[i]>'9')
			f=p[i],p[i]=' ';
	stringstream ss(p);
	ss>>n>>m;
	if(f=='-')
		ans=n-m;
	else ans=m+n;
	if(ans==0)
		{
			printf("+>\n");
			printf("+>\n");
			printf("<[<->-]<\n");
			printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
			return 0;
		}
	while(ans)
		a.push_back(ans%10),ans/=10;
	for(i=a.size()-1; i>=0; i--)
		{
			if(a[i]==0)
				if(ans==0)
					{
						printf("+>\n");
						printf("+>\n");
						printf("<[<->-]<\n");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
						continue;
					}
			int t=a[i]-1;
			for(j=1;j<=t;j++)
				printf("+");
			printf(">\n");
			printf("+>\n");
						printf("<[<+>-]<\n");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
			if(i!=0)
				printf("\n[-]\n");
		}

	return 0;
}


//by 信冯哥
#include<math.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#include<vector>
#include<queue>
#include<sstream>
#include<set>
#include<limits.h>
#include<time.h>
using namespace std;
typedef int _int;
//#define int long long
const int maxn=(int)1e3+5;
#define MOD 1000000007
#define beginn puts("begin")
#define endd puts("end")
#define orz puts("")

int n,m,k,l,s,t,r,T,ans,cas;
string p;
string o;
char f;
vector<int>a;
vector<int>haha;
_int main()
{

	int i,j;
	cin>>p;
	l=p.length();
	o=p;
	for(i=0; i<l; i++)
		if(p[i]<'0'||p[i]>'9')
			f=p[i],p[i]=='-'?haha.push_back(-1):haha.push_back(1),p[i]=' ';
	stringstream ss(p);
	ss>>n;
	int t=-1;
	while(ss>>m)
	{
		n+=(haha[++t])*m;
	}
	ans=n;
	if(ans==0)
		{
			printf("+>\n");
			printf("+>\n");
			printf("<[<->-]<\n");
			printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
			return 0;
		}
	while(ans)
		a.push_back(ans%10),ans/=10;
	for(i=a.size()-1; i>=0; i--)
		{
			if(a[i]==0)
					{
						printf("+>\n");
						printf("+>\n");
						printf("<[<->-]<\n");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
						//	continue;
					}
				else
					{
						int t=a[i]-1;
						for(j=1; j<=t; j++)
							printf("+");
						printf(">\n");
						printf("+>\n");
						printf("<[<+>-]<\n");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
					}
			if(i!=0)
				printf("\n[-]\n");
		}

	return 0;
}


//by 信冯哥
#include<math.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#include<vector>
#include<queue>
#include<sstream>
#include<set>
#include<limits.h>
#include<time.h>
using namespace std;
typedef int _int;
//#define int long long
const int maxn=(int)1e3+5;
#define MOD 1000000007
#define beginn puts("begin")
#define endd puts("end")
#define orz puts("")

int n,m,k,l,s,t,r,T,ans,cas;
string p;
char f;
vector<int>a;
_int main()
{
	int i,j;
	cin>>p;

	l=p.length();
	for(i=0; i<l; i++)
		if(p[i]<'0'||p[i]>'9')
			f=p[i],p[i]=' ';
	stringstream ss(p);
	ss>>n>>m;
	if(f=='-')
		ans=n-m;
	else ans=m+n;
	if(ans==0)
		{
			printf("+>\n");
			printf("+>\n");
			printf("<[<->-]<\n");
			printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
			return 0;
		}
	while(ans)
		a.push_back(ans%10),ans/=10;
	for(i=a.size()-1; i>=0; i--)
		{
			if(a[i]==0)
					{
						printf("+>\n");
						printf("+>\n");
						printf("<[<->-]<\n");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
						//	continue;
					}
				else
					{
						int t=a[i]-1;
						for(j=1; j<=t; j++)
							printf("+");
						printf(">\n");
						printf("+>\n");
						printf("<[<+>-]<\n");
						printf("++++++++++++++++++++++++++++++++++++++++++++++++.");
					}
			if(i!=0)
				printf("\n[-]\n");
		}

	return 0;
}


#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const ll INF = (sizeof(ll) == 8) ? 1e18 : 1e9;

int main()
{
	srand(time(0));
	ios::sync_with_stdio(0);
#ifdef _F1A4X_
	ifstream cin("input.txt");
	ofstream cout("output.txt");
#endif
	string s;
	ll sum = 0, x = 0;
	char l = '+';
	cin >> s;
	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] == '+' || s[i] == '-')
		{
			if (l == '+')
			{
				sum += x;
			}
			else
			{
				sum -= x;
			}
			l = s[i];
			x = 0;
		}
		else
		{
			x = x * 10 + s[i] - '0';
		}
	}
	if (l == '+')
	{
		sum += x;
	}
	else
	{
		sum -= x;
	}
	stringstream str;
	str << sum;
	str >> s;
	for (int i = 0; i < s.size(); i++)
	{
		cout << ">";
		for (int j = 0; j < s[i]; j++)
		{
			cout << "+";
		}
		cout << "." << endl;
	}
	cout << endl;
	return 0;
}


#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const ll INF = (sizeof(ll) == 8) ? 1e18 : 1e9;

int main()
{
	srand(time(0));
	ios::sync_with_stdio(0);
#ifdef _F1A4X_
	ifstream cin("input.txt");
	//ofstream cout("output.txt");
#endif
	string s;
	ll sum = 0, x = 0;
	char l = '+';
	cin >> s;
	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] == '+' || s[i] == '-')
		{
			if (l == '+')
			{
				sum += x;
			}
			else
			{
				sum -= x;
			}
			l = s[i];
			x = 0;
		}
		else
		{
			x = x * 10 + s[i] - '0';
		}
	}
	if (l == '+')
	{
		sum += x;
	}
	else
	{
		sum -= x;
	}
	for (int i = 0; i < sum; i++)
	{
		cout << "+";
	}
	cout << ".";
	cout << endl;
	return 0;
}


#include <iostream>
#include <string>
using namespace std;
int main()
{
    string str;
    cin >> str;
    int i = 0;
    char ch = '1';
    bool flag = false;
    while(i < str.length())
    {
        if (isdigit(str[i]))
        {
            int x = str[i] - '0';
            while(isdigit(str[++i]))
            {
                x = x * 10 + str[i] - '0';
            }
            i--;
            for (int j = 0; j < x; j++)
            {
                cout << '+';
            }
            cout << '>' << endl;
            if (ch != '1')
            {
                cout << "<[<" << ch << ">-]" << endl;
                ch = '1';
            }
            i++;
        }
        else
        {
            ch = str[i];
            i++;
        }
    }
    cout << "++++++++++++++++++++++++++++++++++++++++++++++++.\n";
    //system("pause");
}


/*

 ∧＿＿∧
(。・ω・)つー☆・ * 。
⊂     ノ         .  ゜
し————Ｊ      Accepted

*/

#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")

#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <set>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
//�KAN
template<typename T>
using pair2 = pair<T, T>;

#define forn(i, a, b) for (int i = a; i < b; i++)
#define form(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) a.begin(), a.end()

template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }

static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
	int n;
	cin >> n;

	char c;
	while (cin >> c) {
		int m;
		cin >> m;

		if (c == '+')
			n += m;
		else
			n -= m;
	}

	string s;
	while (n > 0) {
		s += n % 10;
		n /= 10;
	}

	for (int i = s.size() - 1; i >= 0; i--) {
		for (int j = 0; j < s[i] + 48; j++)
			cout << '+';
		cout << ".\n";
	}

	return 0;
}


/*

 ∧＿＿∧
(。・ω・)つー☆・ * 。
⊂     ノ         .  ゜
し————Ｊ      Accepted

*/

#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")

#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <set>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
//�KAN
template<typename T>
using pair2 = pair<T, T>;

#define forn(i, a, b) for (int i = a; i < b; i++)
#define form(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) a.begin(), a.end()

template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }

static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
	int n, m;
	char c;

	cin >> n >> c >> m;

	for (int i = 0; i < n; i++)
		cout << '+';
	cout << ">\n";
	for (int i = 0; i < m; i++)
		cout << '+';
	cout << ">\n";
	cout << "<[<" << c << ">-]<\n";
	int res = (c == '+' ? n + m : n - m);
	res = (res % 256 + 256) % 256;
	cout << "++++++++++++++++++++++++++++++++++++++++++++++++.";

	return 0;
}


/*

 ∧＿＿∧
(。・ω・)つー☆・ * 。
⊂     ノ         .  ゜
し————Ｊ      Accepted

*/

#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")

#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <set>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
//�KAN
template<typename T>
using pair2 = pair<T, T>;

#define forn(i, a, b) for (int i = a; i < b; i++)
#define form(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) a.begin(), a.end()

template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }

static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
	int n;
	cin >> n;

	char c;
	while (cin >> c) {
		int m;
		cin >> m;

		if (c == '+')
			n += m;
		else
			n -= m;
	}

	string s;
	while (n > 0) {
		s += n % 10;
		n /= 10;
	}

	for (int i = s.size() - 1; i >= 0; i--) {
		for (int j = 0; j < s[i] + 48; j++)
			cout << '+';
		cout << ".>\n";
	}

	return 0;
}


/*

 ∧＿＿∧
(。・ω・)つー☆・ * 。
⊂     ノ         .  ゜
し————Ｊ      Accepted

*/

#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")

#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <set>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
//�KAN
template<typename T>
using pair2 = pair<T, T>;

#define forn(i, a, b) for (int i = a; i < b; i++)
#define form(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) a.begin(), a.end()

template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }

static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
	int n;
	cin >> n;

	char c;
	while (cin >> c) {
		int m;
		cin >> m;

		if (c == '+')
			n += m;
		else
			n -= m;
	}

	string s;
	while (n > 0) {
		s += n % 10;
		n /= 10;
	}
	if (s.empty())
		s += 0;

	for (int i = s.size() - 1; i >= 0; i--) {
		for (int j = 0; j < s[i] + 48; j++)
			cout << '+';
		cout << ".>\n";
	}

	return 0;
}


/*

 ∧＿＿∧
(。・ω・)つー☆・ * 。
⊂     ノ         .  ゜
し————Ｊ      Accepted

*/

#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:108777216")

#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <set>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
//�KAN
template<typename T>
using pair2 = pair<T, T>;

#define forn(i, a, b) for (int i = a; i < b; i++)
#define form(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) a.begin(), a.end()

template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }

static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
	int n;
	cin >> n;

	char c;
	while (cin >> c) {
		int m;
		cin >> m;

		if (c == '+')
			n += m;
		else
			n -= m;
	}

	string s;
	while (n > 0) {
		s += n % 10;
		n /= 10;
	}
	if (s.empty())
		s += n;

	for (int i = s.size() - 1; i >= 0; i--) {
		for (int j = 0; j < s[i] + 48; j++)
			cout << '+';
		cout << ".>\n";
	}

	return 0;
}


#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;

string s;
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>s;
	int n=s.length();
	int res=0;
	string tmp="";
	char last='+';
	for(int i=0;i<n;++i)
	{
		if(isdigit(s[i]))
			tmp+=s[i];
		if(!isdigit(s[i])||i+1==n)
		{
			int x=atoi(tmp.c_str());
			res=res+x*(last=='+'?1:-1);
			tmp="";
			last=s[i];
		}
	}
	if(res==0)
		cout<<".";
	else if(res>0)
	{
		for(int j=1;j<=res;++j)
			cout<<"+";
		cout <<".";
	}

	else
	{
		for(int j=1;j<=-res;++j)
			cout<<"-";
		cout <<".";
	}

	return 0;
}


#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;

string s;
vector<int> ans;
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>s;
	int n=s.length();
	int res=0;
	string tmp="";
	char last='+';
	for(int i=0;i<n;++i)
	{
		if(isdigit(s[i]))
			tmp+=s[i];
		if(!isdigit(s[i])||i+1==n)
		{
			int x=atoi(tmp.c_str());
			res=res+x*(last=='+'?1:-1);
			tmp="";
			last=s[i];
		}
	}
	while(res)
	{
		ans.pb(res%10);
		res/=10;
	}
	reverse(ans.begin(), ans.end());
	for(int i=0;i<ans.size();++i)
	{
		int x=ans[i]+48;
		for(int i=1;i<=x;++i)
			cout<<'+';
		cout<<".";
		if(i+1<ans.size())
			cout<<">";
	}
	return 0;
}


#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;

string s;
vector<int> ans;
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>s;
	int n=s.length();
	int res=0;
	string tmp="";
	char last='+';
	for(int i=0;i<n;++i)
	{
		if(isdigit(s[i]))
			tmp+=s[i];
		if(!isdigit(s[i])||i+1==n)
		{
			int x=atoi(tmp.c_str());
			res=res+x*(last=='+'?1:-1);
			tmp="";
			last=s[i];
		}
	}
	if(res==0)
		ans.pb(0);
	while(res)
	{
		ans.pb(res%10);
		res/=10;
	}
	reverse(ans.begin(), ans.end());
	for(int i=0;i<ans.size();++i)
	{
		int x=ans[i]+48;
		for(int i=1;i<=x;++i)
			cout<<'+';
		cout<<".";
		if(i+1<ans.size())
			cout<<">";
	}
	return 0;
}


#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;

string s;
vector<int> ans;
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>s;
	int n=s.length();
	int res=0;
	string tmp="";
	char last='+';
	for(int i=0;i<n;++i)
	{
		if(isdigit(s[i]))
			tmp+=s[i];
		if(!isdigit(s[i])||i+1==n)
		{
			int x=atoi(tmp.c_str());
			res=res+x*(last=='+'?1:-1);
			tmp="";
			last=s[i];
		}
	}
	if(res<0)
	{
		int x=int('-');
		for(int i=1;i<=x;++i)
			cout<<'+';
		cout<<".>";
	}
	while(res)
	{
		ans.pb(res%10);
		res/=10;
	}
	reverse(ans.begin(), ans.end());
	for(int i=0;i<ans.size();++i)
	{
		int x=ans[i]+'0';
		for(int i=1;i<=x;++i)
			cout<<'+';
		cout<<".";
		if(i+1<ans.size())
			cout<<">";
	}
	return 0;
}


#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;

string s;
vector<int> ans;
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>s;
	int n=s.length();
	int res=0;
	string tmp="";
	char last='+';
	for(int i=0;i<n;++i)
	{
		if(isdigit(s[i]))
			tmp+=s[i];
		if(!isdigit(s[i])||i+1==n)
		{
			int x=atoi(tmp.c_str());
			res=res+x*(last=='+'?1:-1);
			tmp="";
			last=s[i];
		}
	}
	if(res==0)
		res.pb(0);
	while(res)
	{
		ans.pb(res%10);
		res/=10;
	}
	reverse(ans.begin(), ans.end());
	for(int i=0;i<ans.size();++i)
	{
		int x=ans[i]+48;
		for(int i=1;i<=x;++i)
			cout<<'+';
		cout<<".";
		if(i+1<ans.size())
			cout<<">";
	}
	return 0;
}


#include <iostream>
using namespace std;

int main() {
	int ans;
	cin >> ans;
	char c;
	while (cin >> c) {
		if (c != '+' && c != '-')
			break;
int i;
		cin >> i;
		if (c == '+')
			ans += i;
		else
			ans -= i;
	}

		for (int j = 0; j < ans; ++j)
			cout << '+';
cout << "\n";
	cout << "++++++++++++++++++++++++++++++++++++++++++++++++.";
	return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main() {
	int ans;
	cin >> ans;
	char c;
	while (cin >> c) {
		if (c != '+' && c != '-')
			break;
int i;
		cin >> i;
		if (c == '+')
			ans += i;
		else
			ans -= i;
	}
	vector<int> vec;
	while (ans) {
		vec.push_back(ans%10);
		ans /= 10;
	}
	for (int i = vec.size() - 1; i >= 0; --i) {
		for (int j = 0; j < vec[i]; ++j)
			cout << '+';
		cout << "++++++++++++++++++++++++++++++++++++++++++++++++.";
	}
	return 0;
}


#include <iostream>
using namespace std;

int main() {
	int ans;
	cin >> ans;
	char c;
	while (cin >> c) {
		if (c != '+' && c != '-')
			break;
int i;
		cin >> i;
		if (c == '+')
			ans += i;
		else
			ans -= i;
	}
		for (int j = 0; j < ans; ++j)
			cout << '+';
cout << ".\n";
	return 0;
}


/*input
10+10

*/
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define ps putchar(' ')
#define pn putchar('\n')
#define ppb pop_back
#define mp make_pair
#define ft first
#define sd second
#define sz size()
#define bn begin()
#define ed end()
#define get(x) scanf("%d", &x);
#define getl(x) scanf("%I64d", &x);
#define PI acos(0)*2
#define puts myputs
#define gets mygets

using namespace std;

inline void pi(int x){if(x==0){putchar('0');return;}char c[10];int k=0;if(x<0){putchar('-');x=-x;}while(x){int nx=x/10;c[k++]=x-nx*10;x=nx;}while(k--){putchar(c[k]+'0');}}
inline void pin(const int&x){pi(x);putchar('\n');};
inline void pl(ll x){if(x==0){putchar('0');return;}char c[19];int k=0;if(x<0){putchar('-');x=-x;}while(x){ll nx=x/10;c[k++]=x-nx*10;x=nx;}while(k--){putchar(c[k]+'0');}}
inline void pln(const ll&x){pl(x);putchar('\n');};
inline void gi(int&val){val=1;char c;do{c=getchar();}while(c!='-'&&(c<'0'||c>'9'));int zn=1;if(c=='-'){zn=-1;c=getchar();}val=c-'0';c=getchar();while(c>='0'&&c<='9'){val*=10;val+=c-'0';c=getchar();}val*=zn;}
inline void gl(ll&val){val=1;char c;do{c=getchar();}while(c!='-'&&(c<'0'||c>'9'));int zn=1;if(c=='-'){zn=-1;c=getchar();}val=c-'0';c=getchar();while(c>='0'&&c<='9'){val*=10;val+=c-'0';c=getchar();}val*=zn;}
inline void gl(ll&val1,ll&val2){gl(val1);gl(val2);}
inline void gi(int&val1,int&val2){gi(val1);gi(val2);}
inline void gl(ll&val1,ll&val2,ll&val3){gl(val1);gl(val2);gl(val3);}
inline void gi(int&val1,int&val2,int&val3){gi(val1);gi(val2);gi(val3);}
inline void mygets(char*b){int i=0;for(;;++i){const char c=getchar();if(c=='\n'||c==EOF){break;}b[i]=c;}b[i]='\0';}
inline void mygets(string&b){int i=0;for(;;++i){const char c=getchar();if(c=='\n'||c==EOF){break;}b.pb(c);}}
inline void mygets(char&b){b=getchar();getchar();}
inline void myputs(const string&b){for(int i=0;i<b.size();++i){putchar(b[i]);}}
inline void putsn(const string&b){puts(b);putchar('\n');}
inline void myputs(const char&b){putchar(b);}
inline void putsn(const char&b){putchar(b);putchar('\n');}

const int N = 1e6 + 7, M = 150000, mod = 1000000007, inf = 1000000007;
const ll lmod = 1000000007, linf = 1e18 + 77;
const ld eps = 1e-14;

void out(char c) {
  for (int i = 0; i < c; i++) {
    putchar('+');
  }
  putchar('.');
  putchar('>');
}

int main() {
  ios_base::sync_with_stdio(false);

  string s;

  gets(s);

  int res = 0;
  int val = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '-') {
      res -= val;
      continue;
    }
    if (s[i] == '+') {
      res += val;
      continue;
    }
    val = val * 10 + s[i] - '0';
  }

  vector <int> num;

  while (res) {
    num.pb(res % 10);
    res /= 10;
  }

  if (num.size() == 0) {
    num.pb(0);
  }

  reverse(num.begin(), num.end());
  for (int i = 0; i < num.size(); i++) {
    out(num[i] + '0');
  }
}


/*input
2+3

*/
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define ps putchar(' ')
#define pn putchar('\n')
#define ppb pop_back
#define mp make_pair
#define ft first
#define sd second
#define sz size()
#define bn begin()
#define ed end()
#define get(x) scanf("%d", &x);
#define getl(x) scanf("%I64d", &x);
#define PI acos(0)*2
#define puts myputs
#define gets mygets

using namespace std;

inline void pi(int x){if(x==0){putchar('0');return;}char c[10];int k=0;if(x<0){putchar('-');x=-x;}while(x){int nx=x/10;c[k++]=x-nx*10;x=nx;}while(k--){putchar(c[k]+'0');}}
inline void pin(const int&x){pi(x);putchar('\n');};
inline void pl(ll x){if(x==0){putchar('0');return;}char c[19];int k=0;if(x<0){putchar('-');x=-x;}while(x){ll nx=x/10;c[k++]=x-nx*10;x=nx;}while(k--){putchar(c[k]+'0');}}
inline void pln(const ll&x){pl(x);putchar('\n');};
inline void gi(int&val){val=1;char c;do{c=getchar();}while(c!='-'&&(c<'0'||c>'9'));int zn=1;if(c=='-'){zn=-1;c=getchar();}val=c-'0';c=getchar();while(c>='0'&&c<='9'){val*=10;val+=c-'0';c=getchar();}val*=zn;}
inline void gl(ll&val){val=1;char c;do{c=getchar();}while(c!='-'&&(c<'0'||c>'9'));int zn=1;if(c=='-'){zn=-1;c=getchar();}val=c-'0';c=getchar();while(c>='0'&&c<='9'){val*=10;val+=c-'0';c=getchar();}val*=zn;}
inline void gl(ll&val1,ll&val2){gl(val1);gl(val2);}
inline void gi(int&val1,int&val2){gi(val1);gi(val2);}
inline void gl(ll&val1,ll&val2,ll&val3){gl(val1);gl(val2);gl(val3);}
inline void gi(int&val1,int&val2,int&val3){gi(val1);gi(val2);gi(val3);}
inline void mygets(char*b){int i=0;for(;;++i){const char c=getchar();if(c=='\n'||c==EOF){break;}b[i]=c;}b[i]='\0';}
inline void mygets(string&b){int i=0;for(;;++i){const char c=getchar();if(c=='\n'||c==EOF){break;}b.pb(c);}}
inline void mygets(char&b){b=getchar();getchar();}
inline void myputs(const string&b){for(int i=0;i<b.size();++i){putchar(b[i]);}}
inline void putsn(const string&b){puts(b);putchar('\n');}
inline void myputs(const char&b){putchar(b);}
inline void putsn(const char&b){putchar(b);putchar('\n');}

const int N = 1e6 + 7, M = 150000, mod = 1000000007, inf = 1000000007;
const ll lmod = 1000000007, linf = 1e18 + 77;
const ld eps = 1e-14;

void out(char c) {
  //cout << c << endl;
  for (int i = 0; i < c; i++) {
    putchar('+');
  }
  putchar('.');
  putchar('>');
}

int main() {
  ios_base::sync_with_stdio(false);

  string s;

  gets(s);

  int res = 0;
  int val = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '-') {
      res -= val;
      val = 0;
      continue;
    }
    if (s[i] == '+') {
      res += val;
      val = 0;
      continue;
    }
    val = val * 10 + s[i] - '0';
  }

  res += val;

  vector <int> num;

  while (res) {
    num.pb(res % 10);
    res /= 10;
  }

  if (num.size() == 0) {
    num.pb(0);
  }

  reverse(num.begin(), num.end());
  for (int i = 0; i < num.size(); i++) {
    out(num[i] + '0');
  }
}


/*input
9-7
*/
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define ps putchar(' ')
#define pn putchar('\n')
#define ppb pop_back
#define mp make_pair
#define ft first
#define sd second
#define sz size()
#define bn begin()
#define ed end()
#define get(x) scanf("%d", &x);
#define getl(x) scanf("%I64d", &x);
#define PI acos(0)*2
#define puts myputs
#define gets mygets

using namespace std;

inline void pi(int x){if(x==0){putchar('0');return;}char c[10];int k=0;if(x<0){putchar('-');x=-x;}while(x){int nx=x/10;c[k++]=x-nx*10;x=nx;}while(k--){putchar(c[k]+'0');}}
inline void pin(const int&x){pi(x);putchar('\n');};
inline void pl(ll x){if(x==0){putchar('0');return;}char c[19];int k=0;if(x<0){putchar('-');x=-x;}while(x){ll nx=x/10;c[k++]=x-nx*10;x=nx;}while(k--){putchar(c[k]+'0');}}
inline void pln(const ll&x){pl(x);putchar('\n');};
inline void gi(int&val){val=1;char c;do{c=getchar();}while(c!='-'&&(c<'0'||c>'9'));int zn=1;if(c=='-'){zn=-1;c=getchar();}val=c-'0';c=getchar();while(c>='0'&&c<='9'){val*=10;val+=c-'0';c=getchar();}val*=zn;}
inline void gl(ll&val){val=1;char c;do{c=getchar();}while(c!='-'&&(c<'0'||c>'9'));int zn=1;if(c=='-'){zn=-1;c=getchar();}val=c-'0';c=getchar();while(c>='0'&&c<='9'){val*=10;val+=c-'0';c=getchar();}val*=zn;}
inline void gl(ll&val1,ll&val2){gl(val1);gl(val2);}
inline void gi(int&val1,int&val2){gi(val1);gi(val2);}
inline void gl(ll&val1,ll&val2,ll&val3){gl(val1);gl(val2);gl(val3);}
inline void gi(int&val1,int&val2,int&val3){gi(val1);gi(val2);gi(val3);}
inline void mygets(char*b){int i=0;for(;;++i){const char c=getchar();if(c=='\n'||c==EOF){break;}b[i]=c;}b[i]='\0';}
inline void mygets(string&b){int i=0;for(;;++i){const char c=getchar();if(c=='\n'||c==EOF){break;}b.pb(c);}}
inline void mygets(char&b){b=getchar();getchar();}
inline void myputs(const string&b){for(int i=0;i<b.size();++i){putchar(b[i]);}}
inline void putsn(const string&b){puts(b);putchar('\n');}
inline void myputs(const char&b){putchar(b);}
inline void putsn(const char&b){putchar(b);putchar('\n');}

const int N = 1e6 + 7, M = 150000, mod = 1000000007, inf = 1000000007;
const ll lmod = 1000000007, linf = 1e18 + 77;
const ld eps = 1e-14;

void out(char c) {
  //cout << c << endl;
  for (int i = 0; i < c; i++) {
    putchar('+');
  }
  putchar('.');
  putchar('>');
}

int main() {
  ios_base::sync_with_stdio(false);

  string s;

  gets(s);

  int res = 0;
  int val = 0;
  bool flag = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '-' || s[i] == '+') {
      if (flag) {
        res -= val;
      } else {
        res += val;
      }
      val = 0;
    }
    if (s[i] == '-') {
      flag = 1;
      continue;
    }
    if (s[i] == '+') {
      flag = 0;
      continue;
    }
    val = val * 10 + (s[i] - '0');
  }

  if (flag) {
    res -= val;
  } else {
    res += val;
  }

  //cout << res << endl;

  vector <int> num;

  while (res) {
    num.pb(res % 10);
    res /= 10;
  }

  if (num.size() == 0) {
    num.pb(0);
  }

  reverse(num.begin(), num.end());
  for (int i = 0; i < num.size(); i++) {
    out(num[i] + '0');
  }
}


#include <iostream>
#include <fstream>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <cstring>
#include <cmath>

#define MN 1000010
#define INF 2147483647
#define PI 3.14159265359
#define pairr pair<int, int>
#define pairrr pair<int, pairr>
#define f first
#define s second
#define pb push_back
#define ll long long
#define MOD 10000007
#define IO ios_base::sync_with_stdio(false); cin.tie();
#define PQT pairr
#define PQL priority_queue<PQT, vector<PQT>, less<PQT> >
#define PQG priority_queue<PQT, vector<PQT>, greater<PQT> >

using namespace std;

int a,i,t,op;
char c=92;
string ch,s;

int main()
{
    IO
//    freopen("input.txt","r",stdin);
    ch+=c;
    freopen(("C:"+ch+"Users"+ch+"Ziya"+ch+"Downloads"+ch+"out.txt").c_str(),"w",stdout);
    cin>>s;
    for (i=0;i<s.length();i++)
    {
        if (s[i]>='0' && s[i]<='9')
        {
            a=a*10+s[i]-'0';
        }
        else
        {
            while (a--)
            {
                cout<<'+';
            }
            a=0;
            cout<<">\n";
            t++;
            if (t>1)
            {
                if (op=='+') cout<<"<<[->+<]>>\n";
                else
                {
                    cout<<"<[<->-]<\n";
                    cout<<"[->+<]>>\n";
                }
            }
            op=s[i];
        }
    }
    while (a--)
    {
        cout<<'+';
    }
    a=0;
    cout<<">\n";
    t++;
    if (t>1)
    {
        if (op=='+') cout<<"<<[->+<]>>\n";
        else
        {
            cout<<"<[<->-]<\n";
            cout<<"[->+<]>>\n";
        }
    }
    /// x x x
//    cout<<"<[>+>+<<-]";
//    cout<<">>[<<+>>-]";
//    cout<<"<[>+>+<<-]";
//    cout<<">>[<<+>>-]";
    cout<<"<";
    cout<<">>++++++++++<<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>>[-]>>>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<<]>[-]>>[>++++++[-<++++++++>]<.<<+>+>[-]]<[<[->-<]++++++[->++++++++<]>.[-]]<<++++++[-<++++++++>]<.[-]<<[-<+>]<";
//    cout<<"[---------------------------------------------------------------------------------------------------->+<]++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>-<";
//    cout<<"[---------->>+<<]++++++++++>>-<<";
//    cout<<"[->>>+<<<]>>>-<<";
//    cout<<"[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]>";
//    cout<<"[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]>";
//    cout<<"[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]";
    return 0;
}


#include <iostream>
#include <fstream>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <cstring>
#include <cmath>

#define MN 1000010
#define INF 2147483647
#define PI 3.14159265359
#define pairr pair<int, int>
#define pairrr pair<int, pairr>
#define f first
#define s second
#define pb push_back
#define ll long long
#define MOD 10000007
#define IO ios_base::sync_with_stdio(false); cin.tie();
#define PQT pairr
#define PQL priority_queue<PQT, vector<PQT>, less<PQT> >
#define PQG priority_queue<PQT, vector<PQT>, greater<PQT> >

using namespace std;

int a,i,t,op;
char c=92;
string ch,s;

int main()
{
    IO
//    freopen("input.txt","r",stdin);
//    ch+=c;
//    freopen(("C:"+ch+"Users"+ch+"Ziya"+ch+"Downloads"+ch+"out.txt").c_str(),"w",stdout);
    cin>>s;
    for (i=0;i<s.length();i++)
    {
        if (s[i]>='0' && s[i]<='9')
        {
            a=a*10+s[i]-'0';
        }
        else
        {
            while (a--)
            {
                cout<<'+';
            }
            a=0;
            cout<<">\n";
            t++;
            if (t>1)
            {
                if (op=='+') cout<<"<<[->+<]>>\n";
                else
                {
                    cout<<"<[<->-]<\n";
                    cout<<"[->+<]>>\n";
                }
            }
            op=s[i];
        }
    }
    while (a--)
    {
        cout<<'+';
    }
    a=0;
    cout<<">\n";
    t++;
    if (t>1)
    {
        if (op=='+') cout<<"<<[->+<]>>\n";
        else
        {
            cout<<"<[<->-]<\n";
            cout<<"[->+<]>>\n";
        }
    }
    /// x x x
//    cout<<"<[>+>+<<-]";
//    cout<<">>[<<+>>-]";
//    cout<<"<[>+>+<<-]";
//    cout<<">>[<<+>>-]";
    cout<<"<";
    cout<<">>++++++++++<<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>>[-]>>>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<<]>[-]>>[>++++++[-<++++++++>]<.<<+>+>[-]]<[<[->-<]++++++[->++++++++<]>.[-]]<<++++++[-<++++++++>]<.[-]<<[-<+>]<";
//    cout<<"[---------------------------------------------------------------------------------------------------->+<]++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>-<";
//    cout<<"[---------->>+<<]++++++++++>>-<<";
//    cout<<"[->>>+<<<]>>>-<<";
//    cout<<"[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]>";
//    cout<<"[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]>";
//    cout<<"[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]";
    return 0;
}


#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;

char st[1231000];
int op[1231231],num[12313],cnt=0;

int calc(int l,int r)
{
    int x=0;
    for(int i=l;i<=r;i++)
        x=x*10+st[i]-'0';
    return x;
}

void work(int&th,int x)
{
    int to=x+48;
    while(th>to)th--,printf("-");
    while(th<to)th++,printf("+");
    printf(".\n");
}

int main()
{
    scanf("%s",st+1);int pre=0;
    for(int i=1;st[i];i++)
    {
        if(st[i]=='+'||st[i]=='-')
        {
            op[++cnt]=(st[i]=='+')?1:2;
            num[cnt]=calc(pre+1,i-1);
            pre=i;
        }
    }
    num[++cnt]=calc(pre+1,strlen(st+1));
    int x=num[1];
    for(int i=1;i<cnt;i++)
    {
        if(op[i]==1)x=x+num[i+1];
        else x=x-num[i+1];
    }
    int th=0;cnt=0;
    if(!x) {work(th,0);return 0;}
    while(x)
    {
        num[++cnt]=x%10;x/=10;
    }
    for(int i=cnt;i;i--)
        work(th,num[i]);
    return 0;
}


fun main() {
    readLine()
    val b = readLine()!!.split(" ").map { it.toInt() }
    val n = b.count { it == -1 }
    val intermediate = MutableList<MutableList<Int>>(n) { mutableListOf() }
    val indices = MutableList(n){it}
    val result = Array<List<Int>>(n) { listOf() }
    var idx = -1
    b.forEach { num ->
        idx = (idx + 1) % intermediate.size
        if (num == -1) {
            result[indices[idx]] = intermediate[idx]
            indices.removeAt(idx)
            intermediate.removeAt(idx)
            idx--
        }else
            intermediate[idx].add(num)

    }
    println(n)
    result.forEach {
        println("${it.size} ${it.joinToString(" ")}")
    }
}


fun main() {
    readLine()
    val b = readLine()!!.split(" ").map { it.toInt() }
    val n = b.count { it == -1 }
    val completed = BooleanArray(n)
    val result = Array<MutableList<Int>>(n) { mutableListOf() }
    var idx = -1
    b.forEach { num ->
        do {
            idx = (idx + 1) % n
        }while (completed[idx])
        if (num == -1)
            completed[idx] = true
        else
            result[idx].add(num)

    }
    println(n)
    result.forEach {
        println("${it.size} ${it.joinToString(" ")}")
    }
}


import java.util.*

fun main() {
//    readFromFile()
    readLine()
    val b = readLine()!!.split(" ").map { it.toInt() }
    val n = b.count { it == -1 }
    val indices = LinkedList<Int>().apply { addAll(0 until n) }
    val result = Array<MutableList<Int>>(n) { mutableListOf() }
    var iterator = indices.iterator()
    b.forEach { num ->
        if (!iterator.hasNext())
            iterator = indices.iterator()
        val idx = iterator.next()
        if (num == -1)
            iterator.remove()
        else
            result[idx].add(num)
    }
    println(n)
    result.forEach {
        println("${it.size} ${it.joinToString(" ")}")
    }
}


fun main() {
    readFromFile()
    readLine()
    val b = readLine()!!.split(" ").map { it.toInt() }
    val n = b.count { it == -1 }
    val intermediate = MutableList<MutableList<Int>>(n) { mutableListOf() }
    val indices = MutableList(n){it}
    val result = Array<List<Int>>(n) { listOf() }
    var idx = -1
    b.forEach { num ->
        idx = (idx + 1) % intermediate.size
        if (num == -1) {
            result[indices[idx]] = intermediate[idx]
            indices.removeAt(idx)
            intermediate.removeAt(idx)
            idx--
        }else
            intermediate[idx].add(num)

    }
    println(n)
    result.forEach {
        println("${it.size} ${it.joinToString(" ")}")
    }
}


import java.util.*

fun main() {
    readLine()
    val b = readLine()!!.split(" ").map { it.toInt() }
    val n = b.count { it == -1 }
    val indices = LinkedList<Int>().apply { addAll(0 until n) }
    val result = Array<MutableList<Int>>(n) { mutableListOf() }
    var idx = -1
    b.forEach { num ->
        if (++idx >= indices.size)
            idx = 0
        if (num == -1) {
            indices.removeAt(idx)
            idx--
        } else
            result[indices[idx]].add(num)
    }
    println(n)
    result.forEach {
        println("${it.size} ${it.joinToString(" ")}")
    }
}


import java.io.*
import kotlin.math.min
import java.util.*
import kotlin.collections.ArrayList
import kotlin.collections.HashSet
import kotlin.math.max

object programkt {
    const val fileName = ""

    //================================================================================

    private fun run() {
        val m = IO.nextInt()
        val arr = ArrayList<Int>()
        for (i in 0 until m) {
            arr.add(IO.nextInt())
        }
        val n = arr.count { it == -1 }
        val res = Array(n) { ArrayList<Int>() }
        var cur = 0
        var i =0
        val near = TreeSet<Int>()
        for(l in 0 until n){
            near.add(l)
        }
        while (i!=arr.size) {
            val a = arr[i]
            if (res[cur].isEmpty() || res[cur].last() != -1) {
                res[cur].add(a)
                if(a == -1){
                    near.remove(cur)
                }
                cur++
                i++
            }
            else{
                cur = near.higher(cur)!!
            }
            cur %= n
        }
        IO.println(n)
        for (ar in res) {
            IO.print("${ar.size-1} ")
            for (i in 0 until ar.size - 1) {
                IO.print("${ar[i]} ")
            }
            IO.println("")
        }

    }

    //==================================================================================

    @JvmStatic
    fun main(args: Array<String>) {
        this.run()
        IO.writer.flush()
        IO.reader.close()

    }

    object IO {
        val reader: BufferedReader
        val writer: PrintWriter
        private var tokenizer: StringTokenizer? = null

        init {
            if (fileName.isEmpty()) {
                reader = BufferedReader(InputStreamReader(System.`in`))
                writer = PrintWriter(System.out)
            } else {
                reader = BufferedReader(FileReader("$fileName.in"))
                writer = PrintWriter(FileWriter("$fileName.out"))
            }
        }

        fun next(): String {
            while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
                val line = reader.readLine() ?: throw NullPointerException()
                if (line == "") {
                    return ""
                }
                tokenizer = StringTokenizer(line)
            }
            return tokenizer!!.nextToken()
        }

        fun nextInt(): Int {
            return next().toInt()
        }

        fun nextDouble(): Double {
            return next().toDouble()
        }

        fun nextLong(): Long {
            return next().toLong()
        }

        fun <T> print(obj: T) {
            writer.print(obj)
        }

        fun <T> println(obj: T) {
            writer.println(obj)
        }
    }
}


import java.io.*
import kotlin.math.min
import java.util.*
import kotlin.collections.ArrayList
import kotlin.collections.HashSet
import kotlin.math.max

object programkt {
    const val fileName = ""

    //================================================================================

    private fun run() {
        val m = IO.nextInt()
        val arr = ArrayList<Int>()
        for (i in 0 until m) {
            arr.add(IO.nextInt())
        }
        val n = arr.count { it == -1 }
        val res = Array(n) { ArrayList<Int>() }
        var cur = 0
        var i =0
        val near = TreeSet<Int>()
        for(l in 0 until n){
            near.add(l)
        }
        while (i!=arr.size) {
            val a = arr[i]
            if (res[cur].isEmpty() || res[cur].last() != -1) {
                res[cur].add(a)
                if(a == -1){
                    near.remove(cur)
                }
                cur++
                i++
            }
            else{
                cur = near.higher(cur)?: near.min()!!
            }
            cur %= n
        }
        IO.println(n)
        for (ar in res) {
            IO.print("${ar.size-1} ")
            for (i in 0 until ar.size - 1) {
                IO.print("${ar[i]} ")
            }
            IO.println("")
        }

    }

    //==================================================================================

    @JvmStatic
    fun main(args: Array<String>) {
        this.run()
        IO.writer.flush()
        IO.reader.close()

    }

    object IO {
        val reader: BufferedReader
        val writer: PrintWriter
        private var tokenizer: StringTokenizer? = null

        init {
            if (fileName.isEmpty()) {
                reader = BufferedReader(InputStreamReader(System.`in`))
                writer = PrintWriter(System.out)
            } else {
                reader = BufferedReader(FileReader("$fileName.in"))
                writer = PrintWriter(FileWriter("$fileName.out"))
            }
        }

        fun next(): String {
            while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
                val line = reader.readLine() ?: throw NullPointerException()
                if (line == "") {
                    return ""
                }
                tokenizer = StringTokenizer(line)
            }
            return tokenizer!!.nextToken()
        }

        fun nextInt(): Int {
            return next().toInt()
        }

        fun nextDouble(): Double {
            return next().toDouble()
        }

        fun nextLong(): Long {
            return next().toLong()
        }

        fun <T> print(obj: T) {
            writer.print(obj)
        }

        fun <T> println(obj: T) {
            writer.println(obj)
        }
    }
}


import java.io.*
import kotlin.math.min
import java.util.*
import kotlin.collections.ArrayList
import kotlin.collections.HashSet
import kotlin.math.max

object programkt {
    const val fileName = ""

    //================================================================================

    private fun run() {
        val m = IO.nextInt()
        val arr = ArrayList<Int>()
        for (i in 0 until m) {
            arr.add(IO.nextInt())
        }
        val n = arr.count { it == -1 }
        val res = Array(n) { ArrayList<Int>() }
        var cur = 0
        var i =0
        while (i!=arr.size) {
            val a = arr[i]
            if (res[cur].isEmpty() || res[cur].last() != -1) {
                res[cur].add(a)
                cur++
                i++
            }
            else{
                cur++
            }
            cur %= n
        }
        IO.println(n)
        for (ar in res) {
            IO.print("${ar.size-1} ")
            for (i in 0 until ar.size - 1) {
                IO.print("${ar[i]} ")
            }
            IO.println("")
        }

    }

    //==================================================================================

    @JvmStatic
    fun main(args: Array<String>) {
        this.run()
        IO.writer.flush()
        IO.reader.close()

    }

    object IO {
        val reader: BufferedReader
        val writer: PrintWriter
        private var tokenizer: StringTokenizer? = null

        init {
            if (fileName.isEmpty()) {
                reader = BufferedReader(InputStreamReader(System.`in`))
                writer = PrintWriter(System.out)
            } else {
                reader = BufferedReader(FileReader("$fileName.in"))
                writer = PrintWriter(FileWriter("$fileName.out"))
            }
        }

        fun next(): String {
            while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
                val line = reader.readLine() ?: throw NullPointerException()
                if (line == "") {
                    return ""
                }
                tokenizer = StringTokenizer(line)
            }
            return tokenizer!!.nextToken()
        }

        fun nextInt(): Int {
            return next().toInt()
        }

        fun nextDouble(): Double {
            return next().toDouble()
        }

        fun nextLong(): Long {
            return next().toLong()
        }

        fun <T> print(obj: T) {
            writer.print(obj)
        }

        fun <T> println(obj: T) {
            writer.println(obj)
        }
    }
}


import java.io.*
import kotlin.math.min
import java.util.*
import kotlin.collections.ArrayList
import kotlin.collections.HashSet
import kotlin.math.max

object programkt {
    const val fileName = ""

    //================================================================================

    private fun run() {
        val m = IO.nextInt()
        val arr = ArrayList<Int>()
        for (i in 0 until m) {
            arr.add(IO.nextInt())
        }
        val n = arr.count { it == -1 }
        val res = Array(n) { ArrayList<Int>() }
        var cur = 0
        var i =0
        val near = TreeSet<Int>()
        for(l in 0 until n){
            near.add(l)
        }
        while (i!=arr.size) {
            val a = arr[i]
            if (res[cur].isEmpty() || res[cur].last() != -1) {
                res[cur].add(a)
                if(a == -1){
                    near.remove(cur)
                }
                cur++
                i++
            }
            else{
                cur = near.min()!!
            }
            cur %= n
        }
        IO.println(n)
        for (ar in res) {
            IO.print("${ar.size-1} ")
            for (i in 0 until ar.size - 1) {
                IO.print("${ar[i]} ")
            }
            IO.println("")
        }

    }

    //==================================================================================

    @JvmStatic
    fun main(args: Array<String>) {
        this.run()
        IO.writer.flush()
        IO.reader.close()

    }

    object IO {
        val reader: BufferedReader
        val writer: PrintWriter
        private var tokenizer: StringTokenizer? = null

        init {
            if (fileName.isEmpty()) {
                reader = BufferedReader(InputStreamReader(System.`in`))
                writer = PrintWriter(System.out)
            } else {
                reader = BufferedReader(FileReader("$fileName.in"))
                writer = PrintWriter(FileWriter("$fileName.out"))
            }
        }

        fun next(): String {
            while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
                val line = reader.readLine() ?: throw NullPointerException()
                if (line == "") {
                    return ""
                }
                tokenizer = StringTokenizer(line)
            }
            return tokenizer!!.nextToken()
        }

        fun nextInt(): Int {
            return next().toInt()
        }

        fun nextDouble(): Double {
            return next().toDouble()
        }

        fun nextLong(): Long {
            return next().toLong()
        }

        fun <T> print(obj: T) {
            writer.print(obj)
        }

        fun <T> println(obj: T) {
            writer.println(obj)
        }
    }
}