include[HTML_REMOVED]
include[HTML_REMOVED]
include [HTML_REMOVED]
define MOD (1e6+5)
using namespace std;
typedef long long LL;
//排列组合 //C(m,n)
//LL C(int m,int n) {int k=1;LL ans=1;while(k<=n) {ans=((m-k+1)*ans)/k;k;}return ans;}
//最大公因数
//int gcd(int a,int b) {if(!a) return b;int c;while(b) {c=b;b=a%b;a=c;}return a;}
//a的n次方(可取模)快速幂
//LL qpow(LL a, LL b) {LL ans = 1;while (b) {if (b & 1) {ans = a;ans %= (int)MOD;}b >>= 1;a = a;a %= (int)MOD;}return ans;}
int main() {
int a,b,flag = 0;
for(int i = 1;i <= 7;i){
cin >> a >> b;
if(a + b > 8){
cout << i;
flag = 1;
break;
}
}
if(flag == 0) cout << 0;
}