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.
//package c296;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Scanner;
import java.util.StringTokenizer;

public class q2 
{

    public static void main(String args[])
    {
        FasterScanner s=new FasterScanner();
        int n=s.nextInt();
        String a=s.nextString();
        String b=s.nextString();
        int p[][]=new int[26][26];
        for(int i=0;i<26;i++)
            Arrays.fill(p[i], -1);
        int ans=0;
        
        for(int i=0;i<n;i++)
        {
            if(a.charAt(i)!=b.charAt(i))
                p[a.charAt(i)-'a'][b.charAt(i)-'a']=i;
            else
                ans++;
        }
        int i1=-1;
        int i2=-1;
        boolean b1=false,b2=false;
        for(int i=0;i<n;i++)
        {
            if(a.charAt(i)!=b.charAt(i))
            {
                if(b2)
                    continue;
                
                if(p[b.charAt(i)-'a'][a.charAt(i)-'a']!=-1)
                {
                    ans++;ans++;
                    i1=i;
                    i2=p[b.charAt(i)-'a'][a.charAt(i)-'a'];
                    b2=true;
                }
                else
                {
                    if(b1)
                        continue;
                    for(int j=0;j<26;j++)
                        if(p[j][a.charAt(i)-'a']!=-1)
                        {
                            ans++;
                            i1=i;
                            i2=p[j][a.charAt(i)-'a'];
                            b1=true;
                            break;
                        }
                }
            }
        }
        if(i1!=-1)
        System.out.println((n-ans)+" \n"+(i2+1)+" "+(i1+1));
        else
            System.out.println((n-ans)+" \n"+(i1)+" "+(i2));
        
        
    }


    public static long gcd(long a, long b) 
    {

        if(a==b)
            return a;
        if(a==0)
            return b;
        if(b==0)
            return a;

        if(a>b)
            return gcd(b,a%b);
        else
            return gcd(a,b%a);
    }

    public static long modPow( long a, long b, long mod )
    {
        long res=1,pow=a;
        while( b>0 )
        {
            if( (b&1)==1 )
            {
                res = (pow*res)%mod;
            }
            pow = (pow*pow)%mod;
            b=b/2;
        }
        return res;
    }
    
    static class nck
    {
        public static long ncr[][];
        
        public nck(long z,long p)//z==maxvalue  p==mod
        {
            generateNCR(z, p);
        }
        
        private static void generateNCR( long z, long p )
        {
            ncr = new long[(int)z+1][(int)z+1];
            ncr[0][0] = 1;
            for(int i=1; i<=z; i++)
            {
                ncr[i][0] = 1;
                ncr[0][i] = 0;
            }
            for(int i=1; i<=z; i++)
            {
                for(int j=1; j<=z; j++)
                {
                    ncr[i][j] = (ncr[i-1][j] + ncr[i-1][j-1]) % p;
                }
            }
        }

        private static long lucas(long n, long k, long p) 
        {
        
            long ans = 1;
            
            while(n>0)
            {
                int N = (int)(n%p);
                int K = (int)(k%p);
                if(K>N)
                    return 0;
                ans *= (ncr[N][K] );
                n /= p;
                k /= p;
            }
            return ans % p;
        }
    }
    
    static class SegTree
    {
        static int seg[];
        static int dp[];
        int n;
        int d;
        public SegTree(int[] arr,int defaul)
        {
            this.dp=arr;
            n=dp.length;
            build(1,0,n);
            this.d=defaul;
        }

        public void build(int id,int l,int r){
            if(r-l<2){
                seg[id]=dp[l];
                return;
            }
            int mid=(l+r)/2;
            build(2*id,l,mid);
            build(2*id+1,mid,r);
            seg[id]=merge(seg[2*id],seg[2*id+1]);
        }

        public int query(int l,int r)
        {
            return givemin(1,l,r,0,n);
        }

        public  int givemin(int id,int x,int y,int l,int r){
            if(x<=l && y>=r){
                return seg[id];
            }
            if(y<=l || r<=x){
                return d;
            }
            int mid=(l+r)/2;
            return merge(givemin(2*id, x, y, l, mid),givemin(2*id+1, x, y, mid, r));
        }

        public int upd(int id,int value)
        {
            return update(1,id,value,0,n);
        }
        public  int update(int id,int p,int value,int l,int r){
            if(r-l<2){
                dp[p]=value;
                seg[id]=value;
                return value;
            }
            int mid=(l+r)/2;
            if(p<mid){
                update(2*id, p, value, l, mid);
                seg[id]=merge(seg[2*id], seg[2*id+1]);
                return seg[id];
            }
            else{
                update(2*id+1, p, value, mid,r);
                seg[id]=merge(seg[2*id+1], seg[2*id]);
                return seg[id];

            }
        }

        public int merge(int l,int r)
        {

            //set initial value
            return l+r;
        }
    }


    static class UF {

        private int[] parent;  // parent[i] = parent of i
        private byte[] rank;   // rank[i] = rank of subtree rooted at i (never more than 31)
        private int count;   
        int[] seg;
        int max;
        // number of components
        public UF(int N) {
            if (N < 0) throw new IllegalArgumentException();
            count = N;
            parent = new int[N];
            rank = new byte[N];
            seg=new int[N];
            for (int i = 0; i < N; i++) {
                parent[i] = i;
                rank[i] = 0;
                seg[i]=1;
            }
            max=1;
        }

        public int find(int p) {
            if (p < 0 || p >= parent.length) throw new IndexOutOfBoundsException();
            while (p != parent[p]) {
                parent[p] = parent[parent[p]];    // path compression by halving
                p = parent[p];
            }
            return p;
        }
        public int count() {
            return count;
        }

        public boolean connected(int p, int q) {
            return find(p) == find(q);
        }

        public boolean union(int p, int q) {
            //    System.out.println("uf "+p+" "+q);
            int rootP = find(p);
            int rootQ = find(q);
            if (rootP == rootQ) return false;

            // make root of smaller rank point to root of larger rank
            if      (rank[rootP] < rank[rootQ])
            {
                parent[rootP] = rootQ;
                seg[rootQ]+=seg[rootP];
                max=Math.max(seg[rootQ],max);
            }
            else if (rank[rootP] > rank[rootQ])
            {
                parent[rootQ] = rootP;
                seg[rootP]+=seg[rootQ];
                max=Math.max(seg[rootP],max);
            }
            else {
                parent[rootQ] = rootP;
                rank[rootP]++;
                seg[rootP]+=seg[rootQ];
                max=Math.max(seg[rootP],max);
            }
            count--;
            return true;
        }

    }



    static class SparseTable
    {
        int[][] st;
        public SparseTable(int[] h){
            int n=h.length;
            int MAX_LOG=(int)Math.ceil(Math.log(n)/Math.log(2))+1;
            st=new int[n][MAX_LOG];
            for (int i = 0; i < n; i++)
                st[i][0] = h[i];
            for (int j = 1; (1 << j) <= n; j++)
            {
                for (int i = 0;( i + (1 << j) - 1 )< n; i++)
                {
                    st[i][j]=Math.max(st[i][j-1],st[i+(1<<(j-1))][j-1]);
                }
            }
        }
        public int query(int l,int r)
        {
            int x=(int )Math.floor((Math.log(r-l+1)/Math.log(2)));
            int ans=Math.max(st[l][x],st[r-(1<<x)+1][x]);
            return ans;
        }

    }

    public static class FasterScanner {
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

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

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

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

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int[] nextIntArray(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        public long[] nextLongArray(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }

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

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

}
