#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<iomanip>
#include<set>
#include<numeric>
#include<sstream>
#include<random>
#include<cassert>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
#define ceil(a, b) a / b + !!(a % b)

int main() {
    int a, b; cin >> a >> b;
    if (a > b) swap(a, b);
    if (a == (double)b / 2) {
        cout << a * 3 << endl;
    } else if (a == (double)b / 3) {
        cout << a * 2 << endl;
    } else if ((double)a / 2 == (double)b / 3) {
        cout << a / 2 << endl;
    } else {
        cout << -1 << endl;
    }
}