#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
int n, q;
const int maxv = 7011;
bitset<7011> m0[7011], m1[7011];
const int maxn = 100111;
bitset<maxv> a[maxn];
int mu[maxv];
int main() {
  mu[1] = 1;
  for (int i = 1; i <= 7000; i++) {
    for (int j = i + i; j <= 7000; j += i) mu[j] ^= mu[i];
  }
  for (int i = 1; i <= 7000; i++) {
    for (int j = 1; j <= 7000; j++) {
      if (i % j == 0) m0[i][j] = 1;
      if (j % i == 0) m1[i][j] = mu[j / i];
    }
  }
  n = getnum(), q = getnum();
  for (int i = 1; i <= q; i++) {
    int op, x, y, z;
    op = getnum(), x = getnum(), y = getnum();
    if (op == 1) {
      a[x] = m0[y];
    } else if (op == 2) {
      z = getnum();
      a[x] = a[y] ^ a[z];
    } else if (op == 3) {
      z = getnum();
      a[x] = a[y] & a[z];
    } else {
      putchar('0' + ((a[x] & m1[y]).count() & 1));
    }
  }
  return 0;
}
