import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

 
public class Main {
	static final long MOD1=1000000007;
	static final long MOD2=998244353;
	public static void main(String[] args) {
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		int N=sc.nextInt();
		HashMap<Long, Long> hashMap=new HashMap<>();
		for (int i = 1; i <= N; i++) {
			HashMap<Long, Long> hashMap2=PrimeFactrization((long)i);
			for (Long l: hashMap2.keySet()) {
				if (hashMap.containsKey(l)) {
					hashMap.put(l, hashMap.get(l)+hashMap2.get(l));
				}else {
					hashMap.put(l, hashMap2.get(l));
				}
			}
		}
		long[] a=new long[5];
		long[] m= {2L,4L,14L,24L,74L};
		for (Long long1: hashMap.keySet()) {
			for (int i = 0; i < m.length; i++) {
				if (hashMap.get(long1)>=m[i]) {
					a[i]++;
				}
			}
		}
		long ans=0;
		ans+=(a[1]*(a[1]-1)/2)*(a[0]-2);
		ans+=(a[0]-1)*a[3];
		ans+=a[4];
		ans+=(a[1]-1)*a[2];
		System.out.println(ans);
	}
	static HashMap<Long, Long> PrimeFactrization(long k){
		HashMap<Long, Long> hashMap=new HashMap<>();
		for (long i = 2; i*i <= k; i++) {
			long count=0;
			if (k%i!=0) {
				continue;
			}
			while (k%i==0) {
				count++;
				k/=i;
			}
			if (hashMap.containsKey(i)) {
				hashMap.put(i,count);
			}
			else {
				hashMap.put(i, count);
			}
		}
		if (k!=1&&!hashMap.containsKey(k)) {
			hashMap.put(k, 1L);
		}
		return hashMap;
	}

		static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
 
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
 
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}


Measured memory_bytes: 32644