Codeforces 760A-Petr and a calendar

Petr and a calendar

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petr wants to make a calendar for current month. For this purpose he draws a table in which columns correspond to weeks (a week is seven consequent days from Monday to Sunday), rows correspond to weekdays, and cells contain dates. For example, a calendar for January 2017 should look like on the picture:

Petr wants to know how many columns his table should have given the month and the weekday of the first date of that month? Assume that the year is non-leap.

Input

The only line contain two integers m and d (1 ≤ m ≤ 12, 1 ≤ d ≤ 7) — the number of month (January is the first month, December is the twelfth) and the weekday of the first date of this month (1 is Monday, 7 is Sunday).

Output

Print single integer: the number of columns the table should have.

Examples

input

1 7

output

6

input

1 1

output

5

input

11 6

output

5

Note

The first example corresponds to the January 2017 shown on the picture in the statements.

In the second example 1-st January is Monday, so the whole month fits into 5 columns.

In the third example 1-st November is Saturday and 5 columns is enough.

题意：告诉你是那个月，这月的一号是星期几，如图求需要几列

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <climits>

using namespace std;

int x[15]={0,31,28,31,30,31,30,31,31,30,31,30,31};

int main()
{
    int m,n;
    while(~scanf("%d %d",&m,&n))
    {
        printf("%d\n",(x[m]-8+n)%7==0?(x[m]-8+n)/7+1:(x[m]-8+n)/7+2);
    }
    return 0;
}