#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <iterator>
#include <string>
#include <algorithm>
#include <sstream>
#include <cmath>

using namespace std;

#define pb push_back
#define mp make_pair
#define make_state make_pair

#define all(x) x.begin(),x.end()
#define forn(x) for(int i=0;i<x;i++)

typedef long double T;
typedef long long ll;

typedef unsigned char uchar;

const int IMPOSSIBLE = -1;

uchar dist[256][256];

void precalc() {
    for(int i = 0; i < 256; i++) {
        for(int j = 0; j < 256; j++) {
            bool found = false;
            for(int k = 0; k <= 8; k++) {
                uchar mask = (1LL << k) - 1;
                if((i ^ mask) == j)
                    dist[i][j] = k, found = true;
            }
            if(!found) dist[i][j] = IMPOSSIBLE;
        }
    }
}

typedef vector<int> sequence;
vector<long long> hashes;
const int p = 271;

void calcHash() {
    hashes[0] = 0;
}

long long subHash(int i, int len) {
    
}

int main() {
    ios_base::sync_with_stdio(false);
    // freopen("in.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    precalc();

    return 0;
}