#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include<cassert>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////

vll mod = { 1000000007,998244353 };

ll pr = 20003;

ll iv(ll i,ll mod) {
	if (i == 1) { return 1; }
	return mod - iv(mod % i,mod) * (mod / i) % mod;
}

ll pw(ll a, ll mod) {
	if (a < 0) { return iv(pw(-a, mod), mod); }

	if (a == 0) { return 1; }
	ll c = pw(a/2, mod);
	c = c * c % mod;
	if (a % 2 == 1) { c = c * pr % mod; }
	return c;
}

int main() {
	ll N;
	cin >> N;
	string S;
	cin >> S;

	map<pair<ll,ll>,set<ll>> mp;

	ll P = 0;

	vll now(2, 0);
	mp[{0, 0}].insert(0);

	vector<pair<ll, ll>> val(N + 1, { 0,0 });
	vll cur(N + 1, P);

	repn(i, N) {
		if (S[i - 1] == '+') {
			rep(j, 2) {
				now[j] += pw(P, mod[j]);
				now[j] %= mod[j];
			}
		}
		else if (S[i - 1] == '-') {
			rep(j, 2) {
				now[j] -= pw(P, mod[j]);
				now[j] = ((now[j] % mod[j]) + mod[j]) % mod[j];
			}
		}
		else if (S[i - 1] == '>') { P++; }
		else { P--; }

		//cout << i << " " << now[0] << " " << now[1] << endl;

		mp[{now[0], now[1]}].insert(i);

		val[i] = { now[0],now[1] };
		cur[i] = P;
	}

	ll ans = 0;

	rep(i, N) {
		mp[val[i]].erase(i);

		ll X = (val[i].first + val[N].first * pw(cur[i], mod[0])) % mod[0];
		ll Y = (val[i].second + val[N].second * pw(cur[i], mod[1])) % mod[1];
		//cout << X << " " << Y << endl;
		ans += mp[{X, Y}].size();
	}
	cout << ans << endl;
}


Measured memory_bytes: 75696