     This program demonstrates search of all nonisomorphic
groups which consist of fixed number of elements.
     For example, it is known that we have two nonisomorphic
groups with four elements: (1) cyclic group C_4; (2) product
C_2 x C_2 . One can show by exhaustive enumeration of all
possible Kely tables (i.e., of "tables of multiplication" for
the groups under study) that for four elements (n=4) these 
two groups are the only possible ones. For example, the group 
of symmetry of water, C_2v, is isomorphic to C_2 x C_2.
     For greater n, the time consumption for exhaustive enumeration 
abruptly increases. In the absence of cutting of branches in
enumeration at as early stage as possible, the growth shoud be
exponential in n; due to cutting, the time of calculation depends 
on time in irregular manner. 
     The presented program allows one to show that for 
n=8 and n=12 we have 5 groups (i.e., 5 groups for each 
of these values of n) and to build their Kely tables.
By the way, one of the groups with n=8 is the group of basical 
quaternions, i.e., +-1, +-i, +-j, +-k. 
     The author can not exclude that the program contains some
bugs which could manifest themselves for n>12.

