require 'prime'
DBG = true

def combi(n,k)
  k=n-k if 2*k > n
  return 1 if k == 0
  ((n-k+1)..n).reduce(&:*)/((1..k).reduce(&:*))
end

n = gets.to_i

a = {}
for i in 2..n
  ls = i.prime_division
  for x in ls
    pr = x[0]
    ex = x[1]
    if a.keys.include?(pr)
      a[pr] += ex
    else
      a[pr] = ex
    end
  end
end

# now a : { 2:3, 3:1, ... }

b = []
for x in a.keys
  b << [x, a[x]]
end

print b if DBG
puts ""

sum = 0
for x in b
  psum = 0
  if x[1] >= 74
    psum += 1
  end
  sum += psum
  if DBG && psum != 0
    printf("%d - add %d", x[0], psum)
    puts ""
  end
end

b.combination(2) { |x,y|
  psum = 0
  if x[1] >= 24 && y[1] >= 2
    psum += 1
  end
  if y[1] >= 24 && x[1] >= 2
    psum += 1
  end
  if x[1] >= 14 && y[1] >= 4
    psum += 1
  end
  if y[1] >= 14 && x[1] >= 4
    psum += 1
  end
  sum += psum
  if DBG && psum != 0
    printf("%d %d - add %d", x[0], y[0], psum)
    puts ""
  end
}

b.combination(3) { |x,y,z|
  if DBG && false
    print x
    puts "--x"
    print y
    puts "---y"
    print z
    puts "----z"
  end
  psum = 0
  if x[1] >= 4 && y[1] >= 4 && z[1] >= 2
    psum += 1
  end
  if x[1] >= 4 && z[1] >= 4 && y[1] >= 2
    psum += 1
  end
  if z[1] >= 4 && y[1] >= 4 && x[1] >= 2
    psum += 1
  end
  sum += psum
  if DBG && psum != 0
    printf("%d %d %d - add %d", x[0], y[0], z[0], psum)
    puts ""
  end
}

print sum
