No co-prime neighbors Given a list of positive integers, output whether every adjacent pair of integers in it shares a prime factor. In other words, output truthy if and only if no two neighboring integers in the list are co-prime.

In yet other terms: given a list of positive integers [a1 a2 … an], output whether

　　　　　　　gcd(a1, a2) > 1 &amp;&amp; gcd(a2, a3) > 1 &amp;&amp; … &amp;&amp; gcd(an−1, an) > 1.

The list will always contain at least two elements (n ≥ 2).

However…

This challenge is also restricted-source: the codepoints in your answer (whatever codepage it may be in) must satisfy the condition your program checks for.

For example, print 2 is a valid program. As a list of Unicode codepoints it is [112 114 105 110 116 32 50], which satisfies this condition: 112 and 114 share a factor of 2; and 114 and 105 share a factor of 3, etc.

However, main can not occur in a valid program (sorry!), as the Unicode codepoints of m and a, namely 109 and 97, are coprime. (Thankfully, your submission needn’t be a full program!)

Your program isn’t allowed to contain codepoint 0.

Test cases

Truthy:

[6 21] -&gt; 1
[502 230 524 618 996] -&gt; 1
[314 112 938 792 309] -&gt; 1
[666 642 658 642 849 675 910 328 320] -&gt; 1
[922 614 530 660 438 854 861 357 477] -&gt; 1


Falsy:

[6 7] -&gt; 0
[629 474 502 133 138] -&gt; 0
[420 679 719 475 624] -&gt; 0
[515 850 726 324 764 555 752 888 467] -&gt; 0
[946 423 427 507 899 812 786 576 844] -&gt; 0


This is code-golf: the shortest code in bytes wins.
MATL, 14 bytes

!TM1*Zdl2$Xdl-


This outputs a non-empty column vector of nonzero numbers as truthy, or a vector containing at least a zero entry as falsy.


Try it online!
Verify all test cases. The footer code contains an if branch to test truthyness/falsyness.
Since MATL uses ASCII, the source code is encoded as

[33 84 77 49 42 90 100 108 50 36 88 100 108 45]


which satisfies the requirement.


Explanation

!     % Implicit input. Transpose
TM    % Push input to latest function again
1*    % Multiply by 1 (does nothing, but matches factors)
Zd    % Compute gcd with broadcast: matrix of gcd of all pairs
l     % Push 1
2$    % The next function will use 2 inputs
Xd    % Extract diagonal 1 (i.e. that below the main diagonal) from the matrix
l-    % Subtract 1 from each entry. Implicitly display