CodeForces-1215C-Swap Letters-思维

Monocarp has got two strings ss and tt having equal length. Both strings consist of lowercase Latin letters "a" and "b".

Monocarp wants to make these two strings ss and tt equal to each other. He can do the following operation any number of times: choose an index pos1pos1 in the string ss, choose an index pos2pos2 in the string tt, and swap spos1spos1 with tpos2tpos2.

You have to determine the minimum number of operations Monocarp has to perform to make ss and tt equal, and print any optimal sequence of operations — or say that it is impossible to make these strings equal.

Input

The first line contains one integer nn (1≤n≤2⋅105)(1≤n≤2⋅105) — the length of ss and tt.

The second line contains one string ss consisting of nn characters "a" and "b".

The third line contains one string tt consisting of nn characters "a" and "b".

Output

If it is impossible to make these strings equal, print −1−1.

Otherwise, in the first line print kk — the minimum number of operations required to make the strings equal. In each of the next kk lines print two integers — the index in the string ss and the index in the string tt that should be used in the corresponding swap operation.

Examples

input

Copy

4
abab
aabb

output

Copy

2
3 3
3 2

input

Copy

1
a
b

output

Copy

-1

input

Copy

8
babbaabb
abababaa

output

Copy

3
2 6
1 3
7 8

Note

In the first example two operations are enough. For example, you can swap the third letter in ss with the third letter in tt. Then s=s= "abbb", t=t= "aaab". Then swap the third letter in ss and the second letter in tt. Then both ss and tt are equal to "abab".

In the second example it's impossible to make two strings equal.

题意：

给出s和t两个长度相等的字符串,问需要交换多少次s和t才能相等
输出次数和需要交换的下标

思路：

分两种情况进行讨论
ababab
babbab
ab=2,ba=1
所以ab+ba=3
即偶+奇=奇（直接输出-1即可）

可以交换成功的,进行分类讨论：
只有ab+ba的和为偶数才可以交换成功，
而出现偶数的可能只有偶+偶=偶或者奇+奇=偶
故此时可以进行下一步判断哪个奇数哪个偶数

abababb
babbaba
ab=2,ba=2
所以ab+ba=4
即偶+偶=偶
所以ab和ab之间交换,ba和ba之间进行交换

abababbab
babbababa
ab=3,ba=3
所以ab+ba=6
即奇+奇=偶
把多余的那一项拿出来单独进行交换即可

 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 #include<iostream>
 using namespace std;
 typedef long long ll;
 const int N=2e5+;
 char s[N],t[N];
 int ab[N],ba[N];//记录下标

 int main()
 {
     int n;
     while(~scanf("%d",&n))
     {
         scanf("%s%s",s,t);
 //        int ab=0,ba=0;
 //        for(int i=0;i<n;i++)
 //        {
 //            if(s[i]=='a'&&t[i]=='b')
 //                ab++;
 //            else if(s[i]=='b'&&t[i]=='a')
 //                ba++;
 //            else
 //                continue;
 //        }
 //        if(ab!=ba)
 //            printf("-1\n");//s=ab、t=ab这样子不对了就
         int p=,q=;
         for(int i=; i<n; i++)
         {
             if(s[i]=='a'&&t[i]=='b')
                 ab[p++]=i+;
             else if(s[i]=='b'&&t[i]=='a')
                 ba[q++]=i+;
             else
                 continue;
         }
         p--,q--;
         int sum=p+q;
         if(sum%)//如果和是奇数
         {
             printf("-1\n");
             continue;
         }
         if(p%&&q%)
         //即奇+奇=偶
         //把多余的那一项拿出来单独进行交换即可
         {
             int kk=(p-)/+(q-)/+;
             printf("%d\n",kk+);
             for(int i=;i<=p-;i+=)
                 printf("%d %d\n",ab[i],ab[i+]);
             for(int i=;i<=q-;i+=)
                 printf("%d %d\n",ba[i],ba[i+]);
             printf("%d %d\n%d %d\n",ba[q],ba[q],ba[q],ab[p]);
         }
         else if(p%==&&q%==)
         //即偶+偶=偶
         //所以ab和ab之间交换,ba和ba之间进行交换
         {
             printf("%d\n",(p+q)/);
             for(int i=;i<=p;i+=)
                 printf("%d %d\n",ab[i],ab[i+]);
             for(int i=;i<=q;i+=)
                 printf("%d %d\n",ba[i],ba[i+]);
         }
     }
     return ;
 }