Given an integer array nums.

Find the number of pairs of disjoint non empty subsequences (seq1, seq2) of nums such that the greatest common divisor of the elements in seq1 equals the greatest common divisor of the elements in seq2.

Since the answer may be very large, return it modulo $10^9 + 7$.

Note:

• A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

• Two subsequences are disjoint if their chosen indices in nums do not overlap.

• The greatest common divisor of a sequence of integers is the largest positive integer that divides all elements in the sequence.

Constraints:

• $1 \leq$ nums.length $\leq 200$

• $1 \leq$ nums[i] $\leq 200$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.