#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first*t.first, s.second*t.second);}
template<class S, class T> pair<S,T> operator%(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first%t.first, s.second%t.second);}

inline ll mod_inverse(ll a, ll m){
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        swap(a -= t * b, b);
        swap(u -= t * v, v);
    }
    return (u % m + m) % m;
}


const int INF = 1<<28;
const double EPS = 1e-8;
const pll MOD = pii(1000000021, 1000000009);

const pll B = pll(10007, 10007);
const pll iB = pll(mod_inverse(10007, 1000000021), mod_inverse(10007, 1000000009));

int T, n, m;
string s;
int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin >> n >> s;
    pll h = pll(0, 0), b = pll(1, 1);
    for (char c : s) {
        if (c == '+') h = (h + b) % MOD;
        if (c == '-') h = (h + MOD - b) % MOD;
        if (c == '>') b = b * B % MOD;
        if (c == '<') b = b * iB % MOD;
    }
    const pll target = h;
    ll ans = 0;
    map<pll, ll> mp;
    mp[pll(0, 0)] = 1;
    h = pll(0, 0), b = pll(1, 1);
    for (char c : s) {
        if (c == '+') h = (h + b) % MOD;
        if (c == '-') h = (h + MOD - b) % MOD;
        if (c == '>') b = b * B % MOD;
        if (c == '<') b = b * iB % MOD;

        ans += mp[(h + MOD - target) % MOD];
        mp[(h + target * b + MOD - target) % MOD] ++;
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 31764