2018-BNUZ-ACM-GDCPC选拔赛（耻辱赛）D 【补题】

A. Mahmoud and Longest Uncommon Subsequence

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challenged Mahmoud with another problem.

Given two strings a and b, find the length of their longest uncommon subsequence, which is the longest string that is a subsequence of one of them and not a subsequence of the other.

A subsequence of some string is a sequence of characters that appears in the same order in the string, The appearances don't have to be consecutive, for example, strings "ac", "bc", "abc" and "a" are subsequences of string "abc" while strings "abbc" and "acb" are not. The empty string is a subsequence of any string. Any string is a subsequence of itself.

Input

The first line contains string a, and the second line — string b. Both of these strings are non-empty and consist of lowercase letters of English alphabet. The length of each string is not bigger than 105 characters.

Output

If there's no uncommon subsequence, print "-1". Otherwise print the length of the longest uncommon subsequence of a and b.

Examples

input

Copy

abcd
defgh

output

Copy

5

input

Copy

a
a

output

Copy

-1

这道逗你玩系列（小q说的），确实是逗你玩，搞的什么子串什么鬼的，题意是两个字符串，能不能从一个字符串中取出一个子串与a的子串不相同，输出最长的可能，其实最长的子串就是本身，也就是说两个字符串如果不相等，那么长的那个的长度就是可以找到的最大长度，如果相等不可能找到合适的子串。

（某q还说5行过。。。。。我还是做不到，这种工作还是交给我们的铁头王来吧）

代码如下 ： 

#include <bits/stdc++.h>

using namespace std;
string a,b;
int main (){
	cin >> a;
	cin >> b;
	int len1 = a.length();
	int len2 = b.length();
	int flag = 0;
//	cout << a << endl << b;
	if(a == b){
		flag = 1;
	}
	if(flag){
		puts("-1");
	}else {
		printf("%d\n",max(len1,len2));
	}
	return 0;
}