#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10;
const int INF32 = 0x3f3f3f3f;
const long long INF64 = 0x3f3f3f3f3f3f3f3f;
const long long MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double EPS = 1.0e-8;
int A[MAXN];
int Sum[750][750];
int q;
int main() {
  while (~scanf("%d", &q)) {
    memset(Sum, 0, sizeof(Sum));
    while (q--) {
      int opt;
      scanf("%d", &opt);
      if (opt == 1) {
        int x, y;
        scanf("%d%d", &x, &y);
        A[x] += y;
        for (int i = 1; i < 750; ++i) Sum[i][x % i] += y;
      } else {
        int x, y;
        scanf("%d%d", &x, &y);
        if (x >= 750) {
          int ans = 0;
          for (int i = y; i <= 5e5; i += x) ans += A[i];
          printf("%d\n", ans);
        } else
          printf("%d\n", Sum[x][y]);
      }
    }
  }
}
