Problem: For given n, l and r find the number of distinct geometrical progression, each of which contains n distinct integers not less than l and not greater than r. In other words, for each progression the following must hold: l ≤ ai ≤ r and ai ≠ aj , where a1, a2, ..., an is the geometrical progression, 1 ≤ i, j ≤ n and i ≠ j.

Geometrical progression is a sequence of numbers a1, a2, ..., an where each term after first is found by multiplying the previous one by a fixed non-zero number d called the common ratio. Note that in our task d may be non-integer. For example in progression 4, 6, 9, common ratio is <image>.

Two progressions a1, a2, ..., an and b1, b2, ..., bn are considered different, if there is such i (1 ≤ i ≤ n) that ai ≠ bi.

Input

The first and the only line cotains three integers n, l and r (1 ≤ n ≤ 107, 1 ≤ l ≤ r ≤ 107).

Output

Print the integer K — is the answer to the problem.

Examples

Input

1 1 10


Output

10

Input

2 6 9


Output

12

Input

3 1 10


Output

8

Input

3 3 10


Output

2

Note

These are possible progressions for the first test of examples: 

  * 1; 
  * 2; 
  * 3; 
  * 4; 
  * 5; 
  * 6; 
  * 7; 
  * 8; 
  * 9; 
  * 10. 



These are possible progressions for the second test of examples: 

  * 6, 7; 
  * 6, 8; 
  * 6, 9; 
  * 7, 6; 
  * 7, 8; 
  * 7, 9; 
  * 8, 6; 
  * 8, 7; 
  * 8, 9; 
  * 9, 6; 
  * 9, 7; 
  * 9, 8. 



These are possible progressions for the third test of examples: 

  * 1, 2, 4; 
  * 1, 3, 9; 
  * 2, 4, 8; 
  * 4, 2, 1; 
  * 4, 6, 9; 
  * 8, 4, 2; 
  * 9, 3, 1; 
  * 9, 6, 4. 



These are possible progressions for the fourth test of examples: 

  * 4, 6, 9; 
  * 9, 6, 4. 

Solution (in JAVA):

Solution:

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

public class F {
	InputStream is;

	int __t__ = 1;
	int __f__ = 0;
	int __FILE_DEBUG_FLAG__ = __f__;
	String __DEBUG_FILE_NAME__ = "src/T";

	FastScanner in;
	PrintWriter out;

	long gcd(long x, long y) {
		if (x == 0 || y == 0) return x + y;
		return gcd(y, x % y);
	}

	long pow(int x, int p) {
		long a = 1;
		for (int i = 0; i < p; i++) {
			a *= x;
		}
		return a;
	}
	
	long MAX = 10_000_100;
	long find(long v, long upper) {
		long lo = 0, hi = MAX;
		while (hi - lo > 1) {
			long mid = (hi + lo) / 2;
			if (v * mid <= upper)
				lo = mid;
			else
				hi = mid;
		}
		return lo;
	}
	public void solve() {
		int n = in.nextInt(), l = in.nextInt(), r = in.nextInt();
		if (n > 25) {
			System.out.println(0);
			return;
		}
		if (n == 1) {
			System.out.println(r - l + 1);
			return;
		} else if (n == 2) {
			long d = (r - l + 1);
			System.out.println((d - 1) * d);
			return;
		}
		
		long res = 0;
		int X = 1;
		while (pow(X, n - 1) <= r) X++;
		long[] powMemo = new long[X+1];
		for (int i = 1; i <= X; i++) {
			powMemo[i] = pow(i, n - 1);
		}
		for (int a = 1; a <= X; a++) {
			for (int b = a + 1; b <= X; b++) {
				if (gcd(a, b) != 1) continue;
				res += Math.max(find(powMemo[b], r) - find(powMemo[a], l - 1), 0) * 2;
			}
		}
		System.out.println(res);
	}

	public void run() {
		if (__FILE_DEBUG_FLAG__ == __t__) {
			try {
				is = new FileInputStream(__DEBUG_FILE_NAME__);
			} catch (FileNotFoundException e) {
				// TODO 自動生成された catch ブロック
				e.printStackTrace();
			}
			System.out.println("FILE_INPUT!");
		} else {
			is = System.in;
		}
		in = new FastScanner(is);
		out = new PrintWriter(System.out);

		solve();
	}

	public static void main(String[] args) {
		new F().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");

		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}

		System.out.println("----------------------------");
		System.out.println();
	}

	public void debug(Object... obj) {
		System.out.println(Arrays.deepToString(obj));
	}

	class FastScanner {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public FastScanner(InputStream stream) {
			this.stream = stream;
			//stream = new FileInputStream(new File("dec.in"));

		}

		int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			return nextIntArray(n, 0);
		}

		int[] nextIntArray(int n, int margin) {
			int[] array = new int[n + margin];
			for (int i = 0; i < n; i++)
				array[i + margin] = nextInt();

			return array;
		}

		int[][] nextIntMap(int n, int m) {
			int[][] map = new int[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextIntArray(m);
			}
			return map;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			return nextLongArray(n, 0);
		}

		long[] nextLongArray(int n, int margin) {
			long[] array = new long[n + margin];
			for (int i = 0; i < n; i++)
				array[i + margin] = nextLong();

			return array;
		}

		long[][] nextLongMap(int n, int m) {
			long[][] map = new long[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextLongArray(m);
			}
			return map;
		}

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

		double[] nextDoubleArray(int n) {
			return nextDoubleArray(n, 0);
		}

		double[] nextDoubleArray(int n, int margin) {
			double[] array = new double[n + margin];
			for (int i = 0; i < n; i++)
				array[i + margin] = nextDouble();

			return array;
		}

		double[][] nextDoubleMap(int n, int m) {
			double[][] map = new double[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextDoubleArray(m);
			}
			return map;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}