import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.TreeSet;

public class Main {

	public static void main(String[] args) {

		FastScanner sc = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);

		long N=sc.nextLong();
		String S=sc.next();
		
		TreeSet<Integer> array0=new TreeSet<Integer>();
		TreeSet<Integer> array1=new TreeSet<Integer>();
		TreeSet<Integer> array2=new TreeSet<Integer>();
		TreeSet<Integer> array3=new TreeSet<Integer>();
		TreeSet<Integer> array4=new TreeSet<Integer>();
		TreeSet<Integer> array5=new TreeSet<Integer>();
		TreeSet<Integer> array6=new TreeSet<Integer>();
		TreeSet<Integer> array7=new TreeSet<Integer>();
		TreeSet<Integer> array8=new TreeSet<Integer>();
		TreeSet<Integer> array9=new TreeSet<Integer>();
		
		for(int i=0;i<N;i++) {
			switch(S.charAt(i)) {
				case '0':
					array0.add(i);
					break;
				case '1':
					array1.add(i);
					break;
				case '2':
					array2.add(i);
					break;
				case '3':
					array3.add(i);
					break;
				case '4':
					array4.add(i);
					break;
				case '5':
					array5.add(i);
					break;
				case '6':
					array6.add(i);
					break;
				case '7':
					array7.add(i);
					break;
				case '8':
					array8.add(i);
					break;
				case '9':
					array9.add(i);
					break;
			}
		}
		
		List<TreeSet<Integer>> arrays=new ArrayList<TreeSet<Integer>>();
		arrays.add(array0);
		arrays.add(array1);
		arrays.add(array2);
		arrays.add(array3);
		arrays.add(array4);
		arrays.add(array5);
		arrays.add(array6);
		arrays.add(array7);
		arrays.add(array8);
		arrays.add(array9);
		
		long ans=0;
		
		for(int i=0;i<10;i++) {
			for(int j=0;j<10;j++) {
				for(int k=0;k<10;k++) {
					
					TreeSet<Integer> leftarray=arrays.get(i);
					TreeSet<Integer> centerarray=arrays.get(j);
					TreeSet<Integer> rightarray=arrays.get(k);
					if(leftarray.isEmpty() || centerarray.isEmpty() || rightarray.isEmpty()) {
						continue;
					}
					
					Integer left=leftarray.higher(-1);
					Integer right=rightarray.lower((int)N+2);
					Integer center=centerarray.higher(left);
					
					if(center==null) {
						continue;
					}
					
					if(left<center && center<right) {
						ans++;
					}
					
				}
			}
		}
		
		out.print(ans);
		out.flush();

	}


}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public int[] nextIntsN(int N) {
		int[] ints = new int[N];
		for (int i = 0; i < N; i++) {
			ints[i] = nextInt();
		}
		return ints;
	}

	public long[] nextLongsN(int N) {
		long[] longs = new long[N];
		for (int i = 0; i < N; i++) {
			longs[i] = nextLong();
		}
		return longs;
	}

	public char[] nextCharsN(int N) {
		char[] chars = new char[N];
		String msg = next();
		for (int i = 0; i < N; i++) {
			chars[i] = msg.charAt(i);
		}
		return chars;
	}

	public char[][] nextCharsHW(int H, int W) {
		char[][] chars = new char[H][W];
		for (int i = 0; i < H; i++) {
			String str = next();
			for (int j = 0; j < W; j++) {
				chars[i][j] = str.charAt(j);
			}
		}
		return chars;
	}

	public int[][] nextIntsNM(int N, int M) {
		int[][] ints = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				ints[i][j] = nextInt();
			}
		}
		return ints;
	}

	public List<Integer> nextArrayIntsN(int N) {
		ArrayList<Integer> array = new ArrayList<>(N);
		for (int i = 0; i < N; i++) {
			array.add(nextInt());
		}
		return array;
	}

	public List<Long> nextArrayLongsN(int N) {
		ArrayList<Long> array = new ArrayList<>(N);
		for (int i = 0; i < N; i++) {
			array.add(nextLong());
		}
		return array;
	}

	public List<List<Long>> nextArrayLongsNM(int N, int M) {

		List<List<Long>> arrays = new ArrayList<List<Long>>(M);
		for (int i = 0; i < M; i++) {
			List<Long> array = nextArrayLongsN(N);
			arrays.add(array);
		}
		return arrays;
	}

}


Measured memory_bytes: 24564