#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long LL;
int main(int argc, char* argv[])
{
	LL A,B;
	cin>>A>>B;
	LL AB=A+B;
	vector<LL> C;
	C.push_back(AB);
	int Num2=0;
	while (AB%2==0){
		Num2++;
		AB/=2;
	}
	LL even=1;
	for (LL i=1;i<=Num2;i++){
		even*=2;
		C.push_back(even);
	}
	for (LL i=1;i<=AB;i+=2){
		if (AB%i==0){
			C.push_back(i);
		}
	}

	sort(C.begin(),C.end());
	vector<LL> C1;
	for (int i=0;i<C.size();i++){
		if ((A+C[i])%B==0 && (B+C[i])%A==0 && A!=C[i] && B!=C[i]){
			C1.push_back(C[i]);
		}
	}
	if (C1.size()==0){
		cout<<-1<<endl;
	}else{
		cout<<C1[0]<<endl;
	}

	return 0;
}