\begin{problem}{Bureaucracy}{bureau.in}{bureau.out}{\timeLimit}

% Original idea : Pavel Mavrin
% Text          : Dmitry Paraschenko
% Tests         : Dmitry Paraschenko

Long ago, in a kingdom far, far away the king decided to keep a record of
all laws of his kingdom. From that moment whenever a new law was passed, a
corresponding record was added to the law archive.

Many centuries later lawyers discovered that there were only two types of
laws in the kingdom:
\begin{shortitems}
    \item \emph{direct law}, that states a new norm;
    \item \emph{canceling law}, that cancels one of the previous laws.
\end{shortitems}

The law is considered \emph{active} if and only if there is no active law
that cancels it.

You are to write program that finds out which laws are still active.

\InputFile

The first line of the input file contains an integer number $n$ 
($1\le n\le 100\,000$) --- the number of passed laws.

The following $n$ lines describe one law each. Each description has 
one of the following formats:
\begin{shortitems}
\item \txt{declare}, meaning that a direct law was passed.
\item \txt{cancel $i$}, where $i$ is the number of law being cancelled by 
    this one.
\end{shortitems}

The laws are numbered from one.

\OutputFile

The first line of the output file must contain the number of active laws.
Following lines must contain numbers of these laws listed in increasing order.

\Example
\begin{example}
\exmp{
5
declare
cancel 1
declare
cancel 2
cancel 3
}{
3
1 4 5
}%
\end{example}

\end{problem}
