def length_longest_path(input):
curr_len, max_len = <NUM_LIT:0>, <NUM_LIT:0>    <EOL>stack = []    <EOL>for s in input.split('<STR_LIT:\n>'):<EOL><INDENT>print("<STR_LIT>")<EOL>print("<STR_LIT>", s)<EOL>depth = s.count('<STR_LIT:\t>')    <EOL>print("<STR_LIT>", depth)<EOL>print("<STR_LIT>", stack)<EOL>print("<STR_LIT>", curr_len)<EOL>while len(stack) > depth:    <EOL><INDENT>curr_len -= stack.pop()<EOL><DEDENT>stack.append(len(s.strip('<STR_LIT:\t>'))+<NUM_LIT:1>)   <EOL>curr_len += stack[-<NUM_LIT:1>]    <EOL>print("<STR_LIT>", stack)<EOL>print("<STR_LIT>", curr_len)<EOL>if '<STR_LIT:.>' in s:    <EOL><INDENT>max_len = max(max_len, curr_len-<NUM_LIT:1>)    <EOL><DEDENT><DEDENT>return max_len<EOL>
:type input: str
:rtype: int