Determine whether a given string of parentheses (multiple types) is properly nested.
A string $S$ consisting of $N$ characters is considered to be properly nested;if any of the following conditions is true:

• $S$ is empty;
• $S$ has the form "(U)" or "\[U\]" or "{U}" where U is a properly nested string;
• $S$ has the form "VW" whereVandWare properly nested strings.

For example, the string "{[()()]}" is properly nested but "([)()]" is not.

Write an efficient algorithm for the following assumptions: 

• $N$ is an integer within the range $[0..200,000]$; 
• string $S$ is made only of the following characters: '(', '{', '[', ']', '}' and/or ')'.

returns $1$ if $S$ is properly nested and $0$ otherwise.