#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };


int number(int *n){
	int ans = 0;
	REP(i, 8){
		ans *= 10;
		ans += n[i];
	}
	return ans;
}
int main() {
	int n[8];
	REP(i,8){
		cin >> n[i];
	}
	vi number_save;
	number_save.push_back(number(n));
	int count = 0;
	int count2 = 0;
	bool bre = false;
	while (1){
		int a = number_save.size() - count;
		REP(j, a){
			if (number_save[count] == 1234567){
				bre = true;
				break;
			}
			int n2[8];
			int zero;
			REP(i, 8){
				n2[i] = (number_save[count] / int(pow(10, 7-i))) % 10;
				if (n2[i] == 0)zero = i;
			}
			if (zero % 4 != 0){
				swap(n2[zero], n2[zero - 1]);
				if (find(number_save.begin(), number_save.end(),number(n2)) == number_save.end())
					number_save.push_back(number(n2));
				swap(n2[zero], n2[zero - 1]);
			}
			if (zero > 3){
				swap(n2[zero], n2[zero - 4]);
				if (find(number_save.begin(), number_save.end(), number(n2)) == number_save.end())
					number_save.push_back(number(n2));
				swap(n2[zero], n2[zero - 4]);
			}
			if (zero % 4 != 3){
				swap(n2[zero], n2[zero + 1]);
				if (find(number_save.begin(), number_save.end(), number(n2)) == number_save.end())
					number_save.push_back(number(n2));
				swap(n2[zero], n2[zero + 1]);
			}
			if (zero < 4){
				swap(n2[zero], n2[zero + 4]);
				if (find(number_save.begin(), number_save.end(), number(n2)) == number_save.end())
					number_save.push_back(number(n2));
				swap(n2[zero], n2[zero + 4]);
			}
			count++;
		}
		if (bre)break;
		count2++;
	}
	cout << count2 << endl;
}