#include<iostream>
using namespace std;int main()
{string x,arr[100];int ind=0,ans=0;cin>>x;
for(unsigned int a=0;a<x.length();a++){
if(x[a]=='.'){
for(int i=0;i<ind;i++)
if(arr[i]==arr[ind])ans++;
arr[ind]="";ind--;}
else if(x[a]==':' || x[a]==',')ind++;
else arr[ind]+=x[a];}cout<<ans<<endl;}
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |