#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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;}
//-------------------------------------------------------

int N;
string S;
int C[101];

void solve() {
	int i,j,k,l,r; string s;
	
	cin>>N>>S;
	int sum=0;
	FOR(i,N) {
		C[S[i]-'0']++;
		sum+=S[i]-'0';
	}
	set<int> S;
	int x,y,z;
	for(x=1;x<=9;x++) for(y=1;y<=9;y++) for(z=1;z<=9;z++) {
		C[x]--;
		C[y]--;
		C[z]--;
		if(C[x]>=0&&C[y]>=0&&C[z]>=0) {
			S.insert((x*100+y*10+z)%40);
		}
		C[x]++;
		C[y]++;
		C[z]++;
	}
	cout<<S.size()<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}