Problem: Ford Prefect got a job as a web developer for a small company that makes towels. His current work task is to create a search engine for the website of the company. During the development process, he needs to write a subroutine for comparing strings S and T of equal length to be "similar". After a brief search on the Internet, he learned about the Hamming distance between two strings S and T of the same length, which is defined as the number of positions in which S and T have different characters. For example, the Hamming distance between words "permanent" and "pergament" is two, as these words differ in the fourth and sixth letters.

Moreover, as he was searching for information, he also noticed that modern search engines have powerful mechanisms to correct errors in the request to improve the quality of search. Ford doesn't know much about human beings, so he assumed that the most common mistake in a request is swapping two arbitrary letters of the string (not necessarily adjacent). Now he wants to write a function that determines which two letters should be swapped in string S, so that the Hamming distance between a new string S and string T would be as small as possible, or otherwise, determine that such a replacement cannot reduce the distance between the strings.

Help him do this!

Input

The first line contains integer n (1 ≤ n ≤ 200 000) — the length of strings S and T.

The second line contains string S.

The third line contains string T.

Each of the lines only contains lowercase Latin letters.

Output

In the first line, print number x — the minimum possible Hamming distance between strings S and T if you swap at most one pair of letters in S.

In the second line, either print the indexes i and j (1 ≤ i, j ≤ n, i ≠ j), if reaching the minimum possible distance is possible by swapping letters on positions i and j, or print "-1 -1", if it is not necessary to swap characters.

If there are multiple possible answers, print any of them.

Examples

Input

9
pergament
permanent


Output

1
4 6


Input

6
wookie
cookie


Output

1
-1 -1


Input

4
petr
egor


Output

2
1 2


Input

6
double
bundle


Output

2
4 1

Note

In the second test it is acceptable to print i = 2, j = 3.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.StringTokenizer;

public class Main {

	void solve() throws IOException {

		io.next();

		char[] s = io.next().toCharArray();
		char[] t = io.next().toCharArray();

		int[][] pos = new int[30][30];

		for (int i = 0; i < pos.length; i++) {
			Arrays.fill(pos[i], -1);
		}

		for(int i = 0; i < s.length; i++) {
			s[i] -= 'a';
			t[i] -= 'a';
		}
		
		int dist = 0;

		for (int i = 0; i < s.length; i++) {
			if (s[i] != t[i]) {
				dist++;
				pos[s[i]][t[i]] = i;
			}
		}

		for (int i = 0; i < s.length; i++) {
			if (s[i] != t[i]) {
				if (pos[t[i]][s[i]] != -1) {
					dist -= 2;
					io.println(dist);
					io.println((i + 1) + " " + (pos[t[i]][s[i]] + 1));
					return;
				}
			}
		}
		
		for (int i = 0; i < s.length; i++) {
			if (s[i] != t[i]) {
				for (int j = 0; j <= 26; j++) {
					if (pos[t[i]][j] != -1) {
						dist -= 1;
						io.println(dist);
						io.println((i + 1) + " " + (pos[t[i]][j] + 1));
						return;
					}
				}
			}
		}
		
		
		io.println(dist);
		io.println("-1 -1");

	}

	// ~~~~~~~~~~~~~~~~~~~~~~~ //

	public static void main(String[] args) throws IOException {
		io = new MyIO(null);
		long timeBegin = System.currentTimeMillis();
		new Main().solve();
		long timeEnd = System.currentTimeMillis();
		System.err.println(timeEnd - timeBegin + " millis");
		io.close();
	}

	static class Geom {

		static final double EPS = 1e-6;

		static int sign(double d) {
			if (Math.abs(d) <= EPS) {
				return 0;
			}
			if (d > 0) {
				return 1;
			} else {
				return -1;
			}
		}

		static class Point {
			double x;
			double y;

			public Point(double x, double y) {
				this.x = x;
				this.y = y;
			}

			public Point add(Vector n) {
				return new Point(x + n.x, y + n.y);
			}

			public Point() {
				x = 0;
				y = 0;
			}

			@Override
			public String toString() {
				return "(" + x + ", " + y + ")";
			}

			double distanceTo(Point b) {
				return Math.sqrt(squareDistanceTo(b));
			}

			double squareDistanceTo(Point b) {
				return (x - b.x) * (x - b.x) + (y - b.y) * (y - b.y);
			}

		}

		static class Vector extends Point {
			public Vector(Point a, Point b) {
				x = b.x - a.x;
				y = b.y - a.y;
			}

			public Vector() {
				super();
			}

			public Vector(double x, double y) {
				this.x = x;
				this.y = y;
			}

			public Vector(Point a) {
				x = a.x;
				y = a.y;
			}

			@Override
			public String toString() {
				return "{" + x + ", " + y + "}";
			}

			public double length() {
				return new Point(0, 0).distanceTo(new Point(x, y));
			}

			public Vector getNormalized() {
				double len = length();
				return new Vector(x / len, y / len);
			}

			public double crossProduct(Vector b) {
				Vector a = this;
				return a.x * b.y - a.y * b.x;
			}

			public double dotProduct(Vector b) {
				Vector a = this;
				return a.x * b.x + a.y * b.y;
			}

		}

		static class Line {
			double a;
			double b;
			double c;

			public Line(Point i, Point j) {
				a = i.y - j.y;
				b = j.x - i.x;
				c = -a * i.x - b * i.y;
			}

			public boolean contains(Point p) {
				return sign(a * p.x + b * p.y + c) == 0;
			}

			public Vector getNormal() {
				return new Vector(a, b).getNormalized();
			}

			public Line(double a, double b, double c) {
				this.a = a;
				this.b = b;
				this.c = c;
			}

			double getX(double y) {
				return (b * y + c) / -a;
			}

			double getY(double x) {
				return (a * x + c) / -b;
			}

			Point intersect(Line l) {
				double z = a * l.b - l.a * b;
				if (sign(z) == 0) {
					return null;
				}
				double x = ((b * l.c) - (l.b * c)) / z;
				double y = ((c * l.a) - (l.c * a)) / z;
				return new Point(x, y);
			}
		}

		static class Polygon {
			ArrayList<Point> points;

			public Polygon() {
				points = new ArrayList<Point>();
			}

			public Polygon(Collection<Point> col) {
				points = new ArrayList<Point>(col);
			}

			double area() {
				double ans = 0;
				for (int i = 0; i < points.size(); i++) {
					Vector a = new Vector(points.get(i));
					Vector b;
					if (i == points.size() - 1) {
						b = new Vector(points.get(0));
					} else {
						b = new Vector(points.get(i + 1));
					}
					ans += a.crossProduct(b);
				}
				return Math.abs(ans / 2);
			}

			boolean contains(Point p) {
				int sign = Integer.MIN_VALUE;
				for (int i = 0; i < points.size(); i++) {
					Point a = points.get(i);
					Point b;
					if (i == points.size() - 1) {
						b = points.get(0);
					} else {
						b = points.get(i + 1);
					}
					Vector ab = new Vector(a, b);
					Vector cp = new Vector(a, p);
					if (sign == Integer.MIN_VALUE) {
						sign = sign(ab.crossProduct(cp));
					} else {
						if (sign != sign(ab.crossProduct(cp))) {
							return false;
						}
					}
				}
				return false;
			}

		}

	}

	static MyIO io;

	static class MyIO {
		BufferedReader in;
		PrintWriter out;

		static final String myIn = "input.txt";
		static final String myOut = "output.txt";

		MyIO(String problemName) throws FileNotFoundException {
			if (new File(myIn).exists()) {
				in = new BufferedReader(new FileReader(new File(myIn)));
				out = new PrintWriter(new File(myOut));
				return;
			} else {
				if (problemName == null) {
					in = new BufferedReader(new InputStreamReader(System.in));
					out = new PrintWriter(System.out);
				} else {
					in = new BufferedReader(new FileReader(new File(problemName
							+ ".in")));
					out = new PrintWriter(new File(problemName + ".out"));
				}
			}
		}

		void println(int i) {
			out.println(i);
		}

		void println(Object s) {
			out.println(s);
		}

		void println(long l) {
			out.println(l);
		}

		void print(Object s) {
			out.print(s.toString());
		}

		void print(char c) {
			out.print(c);
		}

		void println() {
			out.println();
		}

		StringTokenizer tkn = new StringTokenizer("");

		void prepareTokenizer() throws IOException {
			while (!tkn.hasMoreTokens()) {
				tkn = new StringTokenizer(nextLine());
			}
		}

		String nextLine() throws IOException {
			return in.readLine();
		}

		String next() throws IOException {
			prepareTokenizer();
			return tkn.nextToken();
		}

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

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

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

		void close() throws IOException {
			in.close();
			out.close();
		}
	}
}