Problem: Polycarp is working on a new project called "Polychat". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in front of his laptop and implemented a chat server that can process three types of commands:

  * Include a person to the chat ('Add' command). 
  * Remove a person from the chat ('Remove' command). 
  * Send a message from a person to all people, who are currently in the chat, including the one, who sends the message ('Send' command). 



Now Polycarp wants to find out the amount of outgoing traffic that the server will produce while processing a particular set of commands.

Polycarp knows that chat server sends no traffic for 'Add' and 'Remove' commands. When 'Send' command is processed, server sends l bytes to each participant of the chat, where l is the length of the message.

As Polycarp has no time, he is asking for your help in solving this problem.

Input

Input file will contain not more than 100 commands, each in its own line. No line will exceed 100 characters. Formats of the commands will be the following:

  * +<name> for 'Add' command. 
  * -<name> for 'Remove' command. 
  * <sender_name>:<message_text> for 'Send' command. 



<name> and <sender_name> is a non-empty sequence of Latin letters and digits. <message_text> can contain letters, digits and spaces, but can't start or end with a space. <message_text> can be an empty line.

It is guaranteed, that input data are correct, i.e. there will be no 'Add' command if person with such a name is already in the chat, there will be no 'Remove' command if there is no person with such a name in the chat etc.

All names are case-sensitive.

Output

Print a single number — answer to the problem.

Examples

Input

+Mike
Mike:hello
+Kate
+Dmitry
-Dmitry
Kate:hi
-Kate


Output

9


Input

+Mike
-Mike
+Mike
Mike:Hi   I am here
-Mike
+Kate
-Kate


Output

14

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
vector<long long int> v;
vector<long long int> w, ab, bc;
set<long long int> uo;
map<long long int, long long int> ww, cc, u;
vector<pair<long long int, long long int> > uu, su;
map<long long int, vector<long long int> > uuu;
map<pair<long long int, long long int>, long long int> vo;
map<pair<long long int, long long int>, long long int> vu;
map<long long int, pair<long long int, pair<long long int, long long int> > >
    vs;
priority_queue<long long int, vector<long long int>, greater<long long int> >
    moy;
long long int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
long long int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
long long int dxx[] = {2, 1, -1, -2, -2, -1, 1, 2};
long long int dyy[] = {1, 2, 2, 1, -1, -2, -2, -1};
long long int dp[101][10001];
long long int ar[10][10];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  char ch;
  string a, b, c;
  double x, y, d, e, f, g, h;
  long long int n, i, j, k, p, q, o, l, s, tt = 1, m, t, z, aa, r = 0;
  for (long long int mau = 1; mau <= tt; mau++) {
    v.clear();
    w.clear();
    ww.clear();
    uu.clear();
    uo.clear();
    vo.clear();
    vu.clear();
    ab.clear();
    bc.clear();
    cc.clear();
    uuu.clear();
    a.clear();
    b.clear();
    c.clear();
    u.clear();
    k = 0;
    l = 0;
    while (getline(cin, a)) {
      if (a[0] == '+')
        l++;
      else if (a[0] == '-')
        l--;
      else {
        o = a.size();
        for (i = 0; a[i]; i++) {
          if (a[i] != ':')
            o--;
          else {
            o--;
            break;
          }
        }
        k += l * o;
      }
    }
    cout << k << "\n";
  }
  return 0;
}