import math, sys

inStr = "R1, R1, R3, R1, R1, L2, R5, L2, R5, R1, R4, L2, R3, L3, R4, L5, R4, R4, R1, L5, L4, R5, R3, L1, R4, R3, L2, L1, R3, L4, R3, L2, R5, R190, R3, R5, L5, L1, R54, L3, L4, L1, R4, R1, R3, L1, L1, R2, L2, R2, R5, L3, R4, R76, L3, R4, R191, R5, R5, L5, L4, L5, L3, R1, R3, R2, L2, L2, L4, L5, L4, R5, R4, R4, R2, R3, R4, L3, L2, R5, R3, L2, L1, R2, L3, R2, L1, L1, R1, L3, R5, L5, L1, L2, R5, R3, L3, R3, R5, R2, R5, R5, L5, L5, R2, L3, L5, L2, L1, R2, R2, L2, R2, L3, L2, R3, L5, R4, L4, L5, R3, L4, R1, R3, R2, R4, L2, L3, R2, L5, R5, R4, L2, R4, L1, L3, L1, L3, R1, R2, R1, L5, R5, R3, L3, L3, L2, R4, R2, L5, L1, L1, L5, L4, L1, L1, R1"

def getDirNSteps(arg):
    return (arg[0], int(arg[1:]))

inArr = map(getDirNSteps, inStr.split(", "))

xPos = 0
yPos = 0
angle = 0

positions = []
firstRevisitFound = False

for dir, step in inArr:
    angle += math.pi/2.0 if dir == "R" else -math.pi/2.0

    xAng = int(math.sin(angle))
    yAng = int(math.cos(angle))

    for s in xrange(0, step):
        xPos += xAng
        yPos += yAng

        nPos = (xPos, yPos)
        if nPos in positions and not firstRevisitFound:
            print("revisited length: " + str(abs(xPos) + abs(yPos)))
            firstRevisitFound = True

        positions.append(nPos)

print("total length: " + str(abs(xPos) + abs(yPos)))