# Subsets Collection

Author: mathforces
Problem has been solved: 21 times

Русский язык | English Language

Let $S$ be such a set that $| S | = 3$. Let $x$ be the number of collections $A$ consisting of subsets of $S$ such that for any subsets $M$ and $N$ of the set $A$, their intersection and union are also in the set $A$. Find the product of the last two digits of $x$.

Sorry, you need to login into your account