import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		int n = ir.nextInt();
		long[][] a = new long[n][];
		long[][] b = new long[n][2];
		for (int i = 0; i < n; i++)
			a[i] = ir.nextLongArray(2);
		for (int i = 0; i < n; i++)
			for (int j = 0; j < 2; j++)
				b[i][j] = a[i][j];
		Arrays.sort(a, new Comparator<long[]>() {
			public int compare(long[] A, long[] B) {
				if (A[0] != B[0])
					return Long.compare(A[0], B[0]);
				return -Long.compare(A[1], B[1]);
			}
		});
		Arrays.sort(b, new Comparator<long[]>() {
			public int compare(long[] A, long[] B) {
				if (A[1] != B[1])
					return Long.compare(A[1], B[1]);
				return Long.compare(A[0], B[0]);
			}
		});
		long ma = 0, mi = 1L << 60;
		for (int i = 0; i < n; i++) {
			ma = Math.max(ma, a[i][0]);
			mi = Math.min(mi, a[i][1]);
		}
		long res = 0;
		if (a[n - 1][0] == ma && a[n - 1][1] == mi) {
			for (int i = 0; i < n - 1; i++) {
				res = Math.max(res, a[i][1] - a[i][0] + 1);
			}
			res += mi - ma + 1;
		} else {
			boolean f = false;
			for (int i = 0; i < n - 1; i++) {
				if (!f) {
					if (a[i][0] == b[n - 1][0] && a[i][1] == b[n - 1][1]) {
						f = true;
					} else {
						res = Math.max(res, a[i][1] - a[i][0] + 1);
					}
				} else {
					res = Math.max(res, a[i][1] - a[i][0] + 1);
				}
			}
			res += Math.max(mi - ma + 1, 0);
			long l = 0, r = 1L << 60;
			ArrayList<long[]> li = new ArrayList<>();
			for (int i = 0; i < n; i++) {
				if (a[i][0] == ma) {
					r = Math.min(r, a[i][1]);
				} else if (a[i][1] == mi) {
					l = Math.max(l, a[i][0]);
				} else {
					li.add(a[i]);
				}
			}
			long cur = 1L << 60;
			for (int i = li.size() - 1; i >= 0; i--) {
				res = Math.max(res,
						Math.max(mi - Math.max(l, li.get(i)[0]) + 1, 0) + Math.max(Math.min(cur, r) - ma + 1, 0));
				cur = Math.min(cur, li.get(i)[1]);
			}
			res = Math.max(res, Math.max(mi - l + 1, 0) + Math.max(Math.min(cur, r) - ma + 1, 0));
		}
		out.println(res);
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

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

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}


Measured memory_bytes: 34964