const int N = 250005;
const int LG = 21;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

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

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics()
{
    __precomputed_combinatorics = 1;
    __fact.resize(N);
    __ufact.resize(N);
    __rev.resize(N);
    __rev[1] = 1;
    for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
    __fact[0] = 1, __ufact[0] = 1;
    for (int i = 1; i < N; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll cnk(int n, int k)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

int n;
string s;

const ll M = 2;
const ll K[M] = {1000003, 1791791};
const ll rK[M] = {rev(K[0]), rev(K[1])};
ll deg[M][2 * N];

vector<ll> ad(vector<ll> a)
{
    for (int i = 0; i < M; i++)
    {
        a[i]++;
        if (a[i] >= MOD) a[i] -= MOD;
    }
    return a;
}

vector<ll> mi(vector<ll> a)
{
    for (int i = 0; i < M; i++)
    {
        a[i]--;
        if (a[i]  < 0) a[i] += MOD;
    }
    return a;
}

vector<ll> mu(vector<ll> a)
{
    for (int i = 0; i < M; i++) a[i] = a[i] * K[i] % MOD;
    return a;
}

vector<ll> di(vector<ll> a)
{
    for (int i = 0; i < M; i++) a[i] = a[i] * rK[i] % MOD;
    return a;
}

signed main()
{
    for (int i = 0; i < M; i++)
    {
        deg[i][N] = 1;
        for (int j = 1; j < N; j++) deg[i][N + j] = deg[i][N + j - 1] * K[i] % MOD;
        for (int j = 1; j < N; j++) deg[i][N - j] = deg[i][N - j + 1] * rK[i] % MOD;
    }
    srand(time(NULL));
    #ifdef ONLINE_JUDGE
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
    #endif // ONLINE_JUDGE
    cin >> n >> s;
    vector<ll> a(M);
    for (int i = n - 1; i >= 0; i--)
    {
        if (s[i] == '+') a = mi(a);
        if (s[i] == '-') a = ad(a);
        if (s[i] == '>') a = mu(a);
        if (s[i] == '<') a = di(a);
    }
    map<vector<ll>, int> cnt;
    ll ans = 0;
    ll cur_move = 0;
    vector<ll> cur(M, 0);
    cnt[cur]++;
    for (int i = n - 1; i >= 0; i--)
    {
        if (s[i] == '+') for (int j = 0; j < M; j++) cur[j] = (cur[j] + deg[j][N + cur_move]) % MOD;
        if (s[i] == '-') for (int j = 0; j < M; j++) cur[j] = (cur[j] + MOD - deg[j][N + cur_move]) % MOD;
        if (s[i] == '<') cur_move++;
        if (s[i] == '>') cur_move--;
        vector<ll> ask = cur;
        for (int j = 0; j < M; j++) ask[j] = (ask[j] + a[j] * deg[j][N + cur_move]) % MOD;
        ans += cnt[ask];
        cnt[cur]++;
    }
    cout << ans;
}

/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Check corner cases.
No def int long long for now.
*/


Measured memory_bytes: 62980