Codeforces Global Round 7 |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

bitmasks

brute force

dp

meet-in-the-middle

*2600

No tag edit access

The problem statement has recently been changed. View the changes.

×
F1. Wise Men (Easy Version)

time limit per test

2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputThis is the easy version of the problem. The difference is constraints on the number of wise men and the time limit. You can make hacks only if all versions of this task are solved.

$$$n$$$ wise men live in a beautiful city. Some of them know each other.

For each of the $$$n!$$$ possible permutations $$$p_1, p_2, \ldots, p_n$$$ of the wise men, let's generate a binary string of length $$$n-1$$$: for each $$$1 \leq i < n$$$ set $$$s_i=1$$$ if $$$p_i$$$ and $$$p_{i+1}$$$ know each other, and $$$s_i=0$$$ otherwise.

For all possible $$$2^{n-1}$$$ binary strings, find the number of permutations that produce this binary string.

Input

The first line of input contains one integer $$$n$$$ ($$$2 \leq n \leq 14)$$$ — the number of wise men in the city.

The next $$$n$$$ lines contain a binary string of length $$$n$$$ each, such that the $$$j$$$-th character of the $$$i$$$-th string is equal to '1' if wise man $$$i$$$ knows wise man $$$j$$$, and equals '0' otherwise.

It is guaranteed that if the $$$i$$$-th man knows the $$$j$$$-th man, then the $$$j$$$-th man knows $$$i$$$-th man and no man knows himself.

Output

Print $$$2^{n-1}$$$ space-separated integers. For each $$$0 \leq x < 2^{n-1}$$$:

- Let's consider a string $$$s$$$ of length $$$n-1$$$, such that $$$s_i = \lfloor \frac{x}{2^{i-1}} \rfloor \bmod 2$$$ for all $$$1 \leq i \leq n - 1$$$.
- The $$$(x+1)$$$-th number should be equal to the required answer for $$$s$$$.

Examples

Input

3 011 101 110

Output

0 0 0 6

Input

4 0101 1000 0001 1010

Output

2 2 6 2 2 6 2 2

Note

In the first test, each wise man knows each other, so every permutation will produce the string $$$11$$$.

In the second test:

- If $$$p = \{1, 2, 3, 4\}$$$, the produced string is $$$101$$$, because wise men $$$1$$$ and $$$2$$$ know each other, $$$2$$$ and $$$3$$$ don't know each other, and $$$3$$$ and $$$4$$$ know each other;
- If $$$p = \{4, 1, 2, 3\}$$$, the produced string is $$$110$$$, because wise men $$$1$$$ and $$$4$$$ know each other, $$$1$$$ and $$$2$$$ know each other and $$$2$$$, and $$$3$$$ don't know each other;
- If $$$p = \{1, 3, 2, 4\}$$$, the produced string is $$$000$$$, because wise men $$$1$$$ and $$$3$$$ don't know each other, $$$3$$$ and $$$2$$$ don't know each other, and $$$2$$$ and $$$4$$$ don't know each other.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/25/2024 05:39:04 (k1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|