#include <bits/stdc++.h>

using namespace std;

#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;

const int INF = 1 << 29;
const double EPS = 1e-10;

double zero(double d) {
    return d < EPS ? 0.0 : d;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
    os << '[';
    rep(i, a.size()) os << (i ? " " : "") << a[i];
    return os << ']';
}

// to avoid error on mingw
string toString(int i) {
    stringstream ss;
    ss << i;
    return ss.str();
}

const int M = 1000000007;
// a^k
ll fpow(ll a, ll k, int M) {
    ll res = 1ll;
    ll x = a;
    while (k != 0) {
        if ((k & 1) == 1)
            res = (res * x) % M;
        x = (x * x) % M;
        k >>= 1;
    }
    return res;
}

int dr[] = {0,1,0,-1};
int dc[] = {1,0,-1,0};

struct P {
    int r; int c; int prev; int count;
    int puzzle[8];
};

int main() {
    cout.setf(ios::fixed, ios::floatfield);
    cout.precision(8);
    ios_base::sync_with_stdio(false);

    int a[8];
    while(cin >> a[0]) {
        rep(i,7) cin >> a[i+1];

        queue<P> que;
        P p = {0};
        copy(a, a+8, p.puzzle);
        que.push(p);

        while(!que.empty()) {
            P t = que.front(); que.pop();

            bool isGoal = true;
            rep(i,8)
                if(t.puzzle[i] != i) {
                    isGoal = false;
                    break;
                }
            if(isGoal) {
                cout << t.count << endl;
                break;
            }

            rep(i,4) {
                int nr = t.r + dr[i];
                int nc = t.c + dc[i];

                if(nr < 0 || 2 <= nr || nc < 0 || 4 <= nc)
                    continue;
                if(t.prev == (i+2)%4)
                    continue;

                int tmp[8];
                copy(t.puzzle, t.puzzle+8, tmp);
                swap(tmp[t.r * 4 + t.c], tmp[nr * 4 + nc]);

                P next = {0};
                next.r = nr;
                next.c = nc;
                next.prev = i;
                next.count = t.count + 1;
                copy(tmp, tmp+8, next.puzzle);
                que.push(next);
            }
        }


    }

    return 0;
}