import java.util.*;
import java.lang.*;
import java.io.*;

class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		int start = 1;
		int end = 65536;
		
		int[] sieve = getDivisorCount(start, end);
		long sum = 0;
		for(int i=0;i<sieve.length;i++){
			sum += sieve[i];
		}
		System.out.println("divisor count: " + sum);
	}
	
	public static int[] getDivisorCount(int a, int b){
		int[] sieve = new int[b - a + 1];
		double max = Math.ceil(Math.sqrt(b));
		for(int i = 1; i <= max; i++){
			int j = (a / i) * i;
			if(j < a)
				j += i;
			for( ; j <= b; j += i){
				double root = Math.sqrt(j);
				if(i < root){
				    sieve[j - a] += 2;
				}else if(i == root){
				    sieve[j - a]++;
				}
			}
		}
		return sieve;
	}
}