/*
Author: QAQAutomaton
Lang: C++
Code: F.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef complex<double> cp;
typedef pair<int,int> pii;
int inf;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T,class T2>int chkmin(T &a,T2 b){return a>b?a=b,1:0;}
template<class T,class T2>int chkmax(T &a,T2 b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T,class T2>T mmin(T a,T2 b){return a<b?a:b;}
template<class T,class T2>T mmax(T a,T2 b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__{
	__INIT__(){
		memset(&inf,0x3f,sizeof(inf));
		fill((unsigned char*)&inf,(unsigned char*)&inf+sizeof(inf),0x3f);
	}
}__INIT___;
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	template<typename A>
	inline bool read (A &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		while((x=gc())==' '||x=='\n' || x=='\r');
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r');
		if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'||*x==EOF))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	template<typename A>
	inline bool write (A x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
char s[250005];
const int p1=951274487,q1=449117,iq1=694385027;
const int p2=917234839,q2=440941,iq2=9129892;
struct Z1{
	uint x;
	Z1(){}
	Z1(uint a){
		x=a;
	}
};
inline uint modp1(const uint x){
	return x<p1?x:x-p1;
}
inline Z1 operator+(const Z1 x1, const Z1 x2) { return modp1(x1.x+x2.x);}
inline Z1 operator-(const Z1 x1, const Z1 x2) { return modp1(x1.x+p1-x2.x);}
inline Z1 operator-(const Z1 x) {return x.x?p1-x.x:0;}
inline Z1 operator*(const Z1 x1, const Z1 x2) { return static_cast<ull>(x1.x)*x2.x%p1;}
void exgcd(int a,int b,int &x,int &y){
	if(!b){x=1;y=0;return;}
	exgcd(b,a%b,y,x);
	y-=(a/b)*x;
}
inline Z1 Inv(const Z1 a){
	int x,y;
	exgcd(p1,a.x,x,y);
	return y<0?y+=p1:y;
}
inline Z1 operator/(const Z1 x1, const Z1 x2) { return x1*Inv(x2);}

inline Z1 &operator++(Z1 &x1){x1.x==p1-1?x1.x=0:++x1.x;return x1;} 
inline Z1 &operator--(Z1 &x1){x1.x?--x1.x:x1.x=p1-1;return x1;}
inline Z1 &operator+=(Z1 &x1, const Z1 x2) { return x1 = x1 + x2; }
inline Z1 &operator-=(Z1 &x1, const Z1 x2) { return x1 = x1 - x2; }
inline Z1 &operator*=(Z1 &x1, const Z1 x2) { return x1 = x1 * x2; }
inline Z1 &operator/=(Z1 &x1, const Z1 x2) { return x1 = x1 / x2; }

struct Z2{
	uint x;
	Z2(){}
	Z2(uint a){
		x=a;
	}
};
inline uint modp2(const uint x){
	return x<p2?x:x-p2;
}
inline Z2 operator+(const Z2 x1, const Z2 x2) { return modp2(x1.x+x2.x);}
inline Z2 operator-(const Z2 x1, const Z2 x2) { return modp2(x1.x+p2-x2.x);}
inline Z2 operator-(const Z2 x) {return x.x?p2-x.x:0;}
inline Z2 operator*(const Z2 x1, const Z2 x2) { return static_cast<ull>(x1.x)*x2.x%p2;}
inline Z2 Inv(const Z2 a){
	int x,y;
	exgcd(p2,a.x,x,y);
	return y<0?y+=p2:y;
}
inline Z2 operator/(const Z2 x1, const Z2 x2) { return x1*Inv(x2);}

inline Z2 &operator++(Z2 &x1){x1.x==p2-1?x1.x=0:++x1.x;return x1;} 
inline Z2 &operator--(Z2 &x1){x1.x?--x1.x:x1.x=p2-1;return x1;}
inline Z2 &operator+=(Z2 &x1, const Z2 x2) { return x1 = x1 + x2; }
inline Z2 &operator-=(Z2 &x1, const Z2 x2) { return x1 = x1 - x2; }
inline Z2 &operator*=(Z2 &x1, const Z2 x2) { return x1 = x1 * x2; }
inline Z2 &operator/=(Z2 &x1, const Z2 x2) { return x1 = x1 / x2; }

Z1 xpw1[500015],*pw1=xpw1+250005;
Z2 xpw2[500015],*pw2=xpw2+250005;
map<long long,int> mp;
signed main(){
#ifdef QAQAutoMaton 
	freopen("F.in","r",stdin);
	freopen("F.out","w",stdout);
#endif
	int n;
	read(n);
	read(s+1);
	pw1[0]=1;
	for(int i=1;i<=n;++i){pw1[i]=pw1[i-1]*q1;}
	for(int i=1;i<=n;++i){pw1[-i]=pw1[1-i]*iq1;}
	pw2[0]=1;
	for(int i=1;i<=n;++i){pw2[i]=pw2[i-1]*q2;}
	for(int i=1;i<=n;++i){pw2[-i]=pw2[1-i]*iq2;}

	Z1 cur1=1,cnt1=0;
	Z2 cur2=1,cnt2=0;
	for(int i=1;i<=n;++i){
		switch(s[i]){
			case '+':cnt1+=cur1;cnt2+=cur2;break;
			case '-':cnt1-=cur1;cnt2-=cur2;break;
			case '<':cur1*=iq1;cur2*=iq2;break;
			case '>':cur1*=q1;cur2*=q2;break;
		}
	}
	++mp[0];
	int c=0;
	Z1 now1(0),w1(1);
	Z2 now2(0),w2(1);
	ll ans=0;
	for(int i=n;i;--i){
		switch(s[i]){
			case '+': now1+=w1;now2+=w2;break;
			case '-': now1-=w1;now2-=w2;break;
			case '<': ++c;w1*=q1;w2*=q2;break;
			case '>': --c;w1*=iq1;w2*=iq2;break;
		}
		ans+=mp[(ll)((now1-cnt1*pw1[c]).x)*p2+(now2-cnt2*pw2[c]).x];
		++mp[(ll)now1.x*p2+now2.x];
	}
	write(ans,'\n');
	return 0;
}



Measured memory_bytes: 39180