Problem:
ICPC Calculator

In mathematics, we usually specify the order of operations by using
parentheses.
For example, 7 × (3 + 2) always means multiplying 7 by the result of 3 + 2 and never means adding 2 to the result of 7 × 3.

However, there are people who do not like parentheses.
International Counter of Parentheses Council (ICPC) is attempting
to make a notation without parentheses the world standard.
They are always making studies of such no-parentheses notations.

Dr. Tsukuba, a member of ICPC, invented a new parenthesis-free notation.
In his notation, a single expression is represented by multiple
lines, each of which contains an addition operator (+), a
multiplication operator (*) or an integer.
An expression is either a single integer or an operator application to operands.
Integers are denoted in decimal notation in one line.
An operator application is denoted by a line of its operator immediately
followed by lines denoting its two or more operands,
each of which is an expression, recursively.
Note that when an operand is an operator application,
it comprises multiple lines.

As expressions may be arbitrarily nested,
we have to make it clear which operator is applied to which operands.
For that purpose, each of the expressions is given its nesting level.
The top level expression has the nesting level of 0.
When an expression of level n is an operator application,
its operands are expressions of level n + 1.
The first line of an expression starts with a sequence of periods (.),
the number of which indicates the level of the expression.

For example, 2 + 3 in the regular mathematics is denoted as in Figure 1.
An operator can be applied to two or more operands.
Operators + and * represent operations
of summation of all operands and multiplication of all operands,
respectively. For example, Figure 2 shows an expression multiplying
2, 3, and 4.
For a more complicated example, an expression (2 + 3 + 4) × 5 in
the regular mathematics can be expressed as in Figure 3 while (2 + 3) × 4 × 5
can be expressed as in Figure 4.

+
.2
.3

Figure 1: 2 + 3

*
.2
.3
.4

Figure 2: An expression multiplying 2, 3, and 4

*
.+
..2
..3
..4
.5

Figure 3: (2 + 3 + 4) × 5

*
.+
..2
..3
.4
.5

Figure 4: (2 + 3) × 4 × 5

Your job is to write a program that computes the value of expressions
written in Dr. Tsukuba's notation to help him.

Input

The input consists of multiple datasets. Each dataset
starts with a line containing a positive integer n, followed by
n lines denoting a single expression in Dr. Tsukuba's notation.

You may assume that, in the expressions given in the input,
every integer comprises a single digit and that
every expression has no more than nine integers.
You may also assume that all the input expressions are valid
in the Dr. Tsukuba's notation.
The input contains no extra characters, such as spaces or empty lines.

The last dataset is immediately followed by a line with a single zero.

Output

For each dataset, output a single line containing an integer
which is the value of the given expression.

Sample Input

1
9
4
+
.1
.2
.3
9
+
.0
.+
..*
...1
...*
....1
....2
..0
10
+
.+
..6
..2
.+
..1
..*
...7
...6
.3
0

Output for the Sample Input

9
6
2
54

Solution in JAVA (judge verdict: Accepted)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ICPCCalculator solver = new ICPCCalculator();
        try {
            int testNumber = 1;
            while (true)
                solver.solve(testNumber++, in, out);
        } catch (UnknownError e) {
            out.close();
        }
    }

    static class ICPCCalculator {
        int n;
        String[] S;
        boolean[] visited;

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            n = in.nextInt();
            if (n == 0) throw new UnknownError();
            S = new String[n];
            visited = new boolean[n];
            Arrays.fill(visited, false);
            for (int i = 0; i < n; i++) {
                S[i] = in.next();
            }
            if (n == 1) {
                out.println(S[0]);
                return;
            }
            out.println(dfs(0, 0, false));
        }

        private int dfs(int now, int dot, boolean ope) {
            int ans = ope ? 1 : 0;
            for (int i = now; i < n; i++) {
                if (S[i].length() <= dot) break;
                final char c = S[i].charAt(dot);
                if (Character.isDigit(c)) {
                    if (ope) {
                        ans *= c - '0';
                    } else {
                        ans += c - '0';
                    }
                } else if (c == '+' || c == '*') {
                    if (ope) {
                        ans *= dfs(i + 1, dot + 1, c == '*');
                    } else {
                        ans += dfs(i + 1, dot + 1, c == '*');
                    }
                } else if (c == '.') {
                    continue;
                } else {
                    throw new Error();
                }
            }
            return ans;
        }

    }
}