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.stream.IntStream;

public class Main {

	public static void main(String[] args) throws IOException {
		new Main().solve();
	}

	private void solve() throws IOException {
		try {
			//			solveA();
			//			solveB();
			//			solveC();
			//			solveD();
			solveE();
			//			 solveF();
		} finally {
			if (in != null) {
				in.close();
			}
			if (out != null) {
				out.flush();
				out.close();
			}
		}

	}

	private void solveA() {
		char[] wk = next().toCharArray();
		for (int i = 1; i < wk.length; i++) {
			if (wk[i - 1] == wk[i]) {
				out.println("Bad");
				return;
			}
		}

		out.println("Good");
	}

	private void solveB() {
		int a = nextInt();
		int b = nextInt();
		int c = nextInt();

		out.println((a * b * 2) + (b * c * 2) + (c * a * 2));
	}

	private void solveC() {
		int n = nextInt();
		int l = nextInt();

		long total = 0;
		for (int i = 1; i <= n; i++) {
			total += l + i - 1;
		}
		long res = 0;
		long diff = Integer.MAX_VALUE;
		for (int i = 1; i <= n; i++) {
			long tmp = 0;
			for (int j = 1; j <= n; j++) {
				if (i == j) {
					continue;
				}
				tmp += l + j - 1;
			}
			if (diff > Math.abs(total - tmp)) {
				res = tmp;
				diff = Math.abs(total - tmp);
			}
		}

		out.println(res);
	}

	private void solveD() {
		int n = nextInt();

		int[] a1 = IntStream.range(0, n).map(i -> nextInt()).toArray();
		int[] a2 = IntStream.range(0, n).map(i -> nextInt()).toArray();

		long res = recurisveD(a1, a2, n, 0, 0);
		out.println(res);
	}

	private long recurisveD(int[] a1, int[] a2, int n, int currentY, int currentX) {

		if (currentY >= 2 || currentX >= n) {
			return 0;
		}
		long candy = currentY == 0 ? a1[currentX] : a2[currentX];
		long val1 = recurisveD(a1, a2, n, currentY + 1, currentX);
		long val2 = recurisveD(a1, a2, n, currentY, currentX + 1);

		return Math.max(val1, val2) + candy;
	}

	private void solveE() {
		int a = nextInt();
		int b = nextInt();
		int res = 0;
		for (int i = a; i <= b; i++) {
			List<Integer> memo = new ArrayList<Integer>();
			int tmp = i;
			while (tmp != 0) {
				memo.add(tmp % 10);
				tmp /= 10;
			}
			boolean isOk = true;
			for (int j = 0; j < memo.size() / 2; j++) {
				if (memo.get(j) != memo.get(memo.size() - 1 - j)) {
					isOk = false;
					break;
				}
			}
			if (isOk) {
				res++;
			}

		}

		out.println(res);
	}

	private void solveF() {
		int n = nextInt();

		out.println("");
	}

	private final PrintWriter out = new PrintWriter(System.out);
	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;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

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

	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();
		}
	}
}

Measured memory_bytes: 28368