#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:268435456")
using namespace std;
template <typename T>
inline T abs(T a) {
  return ((a < 0) ? -a : a);
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sign(T a) {
  return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int dxK[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dyK[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dxKn[] = {-2, -1, 1, 2, 2, 1, -1, -2};
const int dyKn[] = {1, 2, 2, 1, -1, -2, -2, -1};
const int N = int(3e2) + 5;
const int M = int(3e2) + 9;
const int LOGN = 21;
const int SQN = 350;
const int MOD = int(1e9) + 7;
const int INF = int(1e9) + 100;
const long long INF64 = 2e18;
const double PI = double(3.1415926535897932384626433832795);
const double e = double(2.7182818284590452353602874713527);
const double EPS = 1e-9;
int h, q;
map<int, int> a;
map<int, int> suma;
double rec(int v, int curh, int mx) {
  if (curh == h) return max(mx, a[v]);
  int l = 0, r = 0;
  if (suma.count(v * 2 + 1)) l = suma[v * 2 + 1];
  if (suma.count(v * 2 + 2)) r = suma[v * 2 + 2];
  if (a.count(v)) l += a[v], r += a[v];
  if (l == r) return max(mx, l);
  if (l > r)
    return 0.5 * max(l, mx) + 0.5 * rec(v * 2 + 1, curh + 1, max(mx, r));
  else
    return 0.5 * max(r, mx) + 0.5 * rec(v * 2 + 2, curh + 1, max(mx, l));
}
char buf[10];
void solve() {
  cin >> h >> q;
  for (int i = 0; i < (int)(q); ++i) {
    scanf("%s", buf);
    if (buf[0] == 'a') {
      int v, e;
      scanf("%d %d", &v, &e);
      --v;
      a[v] += e;
      while (v > 0) suma[v] += e, v = (v - 1) / 2;
      suma[v] += e;
    } else {
      double res = rec(0, 0, 0);
      cout << res << endl;
    }
  }
}
int main() {
  srand(time(NULL));
  cout << setprecision(25) << fixed;
  cerr << setprecision(25) << fixed;
  solve();
  return 0;
}
