//		Задача номер 2 (ДВА)
#include<fstream.h>
#include<math.h>

void main()
{
  ifstream in("input.txt",ios::nocreate);
  ofstream out("output.txt");
  const MAXN=10000;
  int n,result=0, xCounter=0,path, yCounter=0, zCounter=0, signCounter=0;
  int maxx=0,maxy=0,maxz=0,minx=0,miny=0,minz=0;
  char sign;
  signed int x[MAXN],y[MAXN],z[MAXN];
  in>>n;
  char signs[MAXN];
  for (int bocderiger=0; bocderiger<n; bocderiger++){
   x[bocderiger]=0;
   y[bocderiger]=0;
   z[bocderiger]=0;
   signs[bocderiger]='\0';
  }
  for (int i=0; i<n; i++)
  {
    in>>sign>>path;
    signs[signCounter]=sign;
    signCounter++;
    if (sign=='x' || sign=='X'){
      x[xCounter]=path;
      xCounter++;
    }
    if (sign=='y' || sign=='Y'){
      y[yCounter]=path;
      yCounter++;
    }
    if (sign=='z' || sign=='Z'){
      z[zCounter]=path;
      zCounter++;
    }
  }
  for (int xx=1; xx<n; xx++)
   if(x[xx-1]<x[xx])maxx=x[xx];
  for (int yx=1; yx<n; yx++)
   if(y[yx-1]<y[yx])maxy=y[yx];
  for (int zx=1; zx<n; zx++)
   if(z[zx-1]<z[zx])maxz=z[zx];
  {
  for (int xx=1; xx<n; xx++)
   if(x[xx-1]>x[xx])minx=x[xx];
  for (int yx=1; yx<n; yx++)
   if(y[yx-1]>y[yx])miny=y[yx];
  for (int zx=1; zx<n; zx++)
   if(z[zx-1]>z[zx])minz=z[zx];
  }
  result=maxx+minx+maxy+miny+maxz+minz;
  result=abs(result);
  out<<result;
}