CF_5A_ChatServer'sOutgoingTraffic

A. Chat Server's Outgoing Traffic

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

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 lbytes 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

+MikeMike:hello+Kate+Dmitry-DmitryKate:hi-Kate

output

9

input

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

output

14

题意有三种操作

多一个人 少一个人 给存在的所有人（包括自己）发一个信息

这个题目说的天花乱坠 但是其实根本没有必要知道输进来的人是谁

因为题目保证了输入的新人原来没有过

删掉的人必定是增加过并且没删过的

因此只需要管理下总人数就可以了

#include <iostream>#include <stdio.h>using namespace std;const int M=1005;char s[M];int main(){    int ans=0;    int num=0;    //freopen("1.in","r",stdin);    while(gets(s)!=NULL)    {        if(s[0]=='+')        {            num++;continue;        }        if(s[0]=='-')        {            num--;continue;        }        int i=0;        while(s[i++]!=':');        int l=0;        while(s[i++]!='\0')            l++;        ans+=l*num;    }    printf("%d\n",ans);    return 0;}