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:

<image>

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.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int m = sc.nextInt();
            int d = sc.nextInt();
            int add = 0, j, ans = 0;
            if (m == 2) {
                if (d <= 7) {
                    ans = 7 - d;
                    add++;
                }
                for (j = 1 + ans + 7; j <= 28; j = j + 7)
                    add++;
                if (j - 7 < 28)
                    add++;
            }
            if ((m % 2 != 0 && m < 8) || m == 8 || m == 10 || m == 12) {
                if (d <= 7) {
                    ans = 7 - d;
                    add++;
                }
                for (j = 1 + ans + 7; j <= 31; j = j + 7)
                    add++;
                if (j - 7 < 31)
                    add++;
            } else if ((m % 2 == 0 && m < 7 && m != 2) || m == 9 || m == 11) {
                if (d <= 7) {
                    ans = 7 - d;
                    add++;
                }
                for (j = 1 + ans + 7; j <= 30; j = j + 7)
                    add++;
                if (j - 7 < 30)
                    add++;
            }
            out.println(add);
        }

    }
}

