![]() | Eight queens puzzle was a Mathematics good articles nominee, but did not meet the good article criteria at the time. There may be suggestions below for improving the article. Once these issues have been addressed, the article can be renominated. Editors may also seek a reassessment of the decision if they believe there was a mistake. | |||||||||
|
![]() | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: |
||||||||||||||||||||
|
solution is only for gcd(N, 6)=1(odd numbers bigger than 6). A Matlab program is in the file-exchange repository. I will not include a link, but type in Matlab fileexchange: N-Queen problem modular. It will flash there. Mihail Georgiev
195.75.72.179 (talk) 16:01, 27 September 2017 (UTC)
How about some attribution or reference for the simple algorithm? When was it discovered? Given the number of published algorithms using various kinds of search even for finding single solutions, it would seem that this has to be a fairly recent discovery? Or?
Who is Paul Muljadi? From a quick Google search, I gather that he is a Chess buff & possibly one of the top players, but seeing how his name is mentioned in a couple of Wikipedia articles & he provides no personal information on his website (or even a clear way to navigate it), it would be nice to provide an article with a few sentences about him. -- llywrch 15:25, 24 Apr 2004 (UTC)
It seems that almost the same web page exist, here is the link: http://www.informationclub.com/encyclopedia/e/ei/eight_queens_puzzle.html
Also say:
Copyright ©2003 InformationClub.com This content from encyclopedia is licensed under the GNU Free Documentation License
--andrejj 18:55, 15 Aug 2004 (UTC)
I believe the InformationClub is copying their pages verbatim from the Wikipedia. Other entities have similar copies, such as http://www.wordiq.com and http://www.fact-index.com PittBill 23:08, 15 Aug 2004 (UTC)
And then the formula is not given, only the values. -- WhiteDragon 06:26, 10 Feb 2005 (UTC)
That's because the formula is unknown. See [1] for more information on the numbers of possible solutions. PittBill 10:43, 10 Feb 2005 (UTC)
I do see WhiteDragon's point, and have removed the In general since the table only gives values for specific N's, not a general formula. PittBill 23:47, 12 Feb 2005 (UTC)
A rough approximation to the amount of "all" solutions up to N = 26 can be given by 5 * factorial(N) / 2.4^N. Sorry... don't have a reference for it :(
XWolfRH (talk) 22:20, 25 April 2016 (UTC)
For N=2 and N=3 there are no solutions. For all other values of N<600 there is at least one solution. This I know because For each of these values of N I computed a solution. I conjecture that solutions exist for all values of N excep N=2 and N=3. Does somebody know something about this conjecture, may be even a proof or a counterfact? Thanks Jos.koot (talk) 18:00, 9 July 2010 (UTC)
Answer: Your conjecture has been known to be true for quite some time. Read the "Constructing a Solution" section of the Eight Queens Puzzle page. The procedure in that section produces a solution for every N>3. For similar proofs of your conjecture, read Bell, Jordan and Stevens, Brett, A survey of known results and research areas for n-queens, Discrete Mathematics, Vol. 309, Issue 1, 6 January 2009, 1-31. PittBill (talk) 14:18, 10 July 2010 (UTC)
Thanks, Jos.koot (talk) 14:58, 10 July 2010 (UTC)
What is CLP(FD)? PittBill 01:23, 6 Jun 2005 (UTC)
I think the part talking about the 'minimum-conflicts' heuristic is incorrect, because that heuristic gets trapped at local optimal solutions(i.e. no single move can improve the solution quality).
I am missing either link or listing of brilliant sollution posted to Usenet. Philipz 09:07, 11 Sep 2005 (CEST)
#include <stdio.h> static int count = 0; void try(int row, int left, int right) { int poss, place; if (row == 0xFF) ++count; else { poss = ~(row|left|right) & 0xFF; while (poss != 0) { place = poss & -poss; try(row|place, (left|place)<<1, (right|place)>>1); poss &= ~place; } } } void main() { try(0,0,0); printf("There are %d solutions.\n", count); }
It's not brilliant, though it is compact. Similar code that works for N other than 8 and takes half as long to run by counting vertically symmetric solutions only once can be found at https://rosettacode.org/wiki/N-queens_problem#C -- Jibal (talk) 09:39, 7 June 2022 (UTC)
The eight-queens problem doesn't seem to be exact cover. A solution for a square larger than 1x1 can not use all the nontrivial diagonals (2x2 and 3x3 have no solutions, and for n > 3, 2n-3 > n). Should "such that every column has a 1 in precisely one of the chosen rows" be restated to "such that each of the first 2n columns has a 1 in precisely one of the chosen rows, and each other column has a 1 in at most one of the chosen rows."? Ralphmerridew 20:12, 17 January 2006 (UTC)
Maybe this should be more explicit, but it's easy to extend any problem of the form "these columns get exactly one 1 and these get at most one 1" to a normal exact cover by just adding a bunch of rows that are all zeros except for having a 1 in one of the "at most 1" rows. (Though it'll be more efficient to use an algorithm that understands the extended problem directly.) Glasser 14:04, 20 January 2006 (UTC)
Here's a simple implementation in Python that generates all 8-castles solutions by a permutations() generator, then filters diagonals by checking that the set of diagonals represented has 8 elements. I think this is a more clear solution of the problem in Python, but the article's current recursive solution is probably better for readers because it represents how the problem would be solved in most languages.
# Print all solutions to 8-queens problem. Public domain, Connelly Barnes 2006.
def permutations(L):
if len(L) <= 1:
yield list(L)
else:
for i in range(len(L)):
for p in permutations(L[:i]+L[i+1:]):
yield [L[i]] + p
def queens(n):
for L in permutations(range(n)):
if (len(set(i+L[i] for i in range(n))) == n and # Main diagonals
len(set(i-L[i] for i in range(n))) == n): # Skew diagonals
yield L
if __name__ == '__main__':
for sol in queens(8):
for col in sol:
print '.'*col + 'Q' + '.'*(8-1-col)
print
You can shorten the code significantly at the expense of clarity by using generator expressions.
- Connelly 00:29, 11 May 2006 (UTC)
..is it possible to cover a 8x8 chesstable with 4 queens?
The number of solutions for covering an n by n chessboard with 4 queens are as follows (including rotational and reflectional variants):
n | Solutions | ||
5 | 5230 | ||
6 | 2744 | ||
7 | 86 | ||
8 | 0 |
Computed by a J program. Roger Hui 06:10, 19 May 2006 (UTC)
See the actual program. Roger Hui 17:24, 19 May 2006 (UTC)
The statement
The GNU Prolog program below resolved a 100 queens problem in less than a tenth of a second.
is meaningless without a frame of reference. Giving at least the processor used for the test and the time of a slower algorithm would help matters greatly. Andrew J. MacDonald 03:51, 30 November 2006 (UTC)
The article seems to be arbitrarily using the words "distinct" and "unique" with its own meanings. While it does help to make it less verbose, "unique" already has the usual meaning of being the only one of something, and it's absurd to speak of "unique solution 1, unique solution 2", etc. If at all there is a unique solution, there can be only of it. Does anyone have any suggestions on what to use in place of "unique"? ("Truly distinct", "distinct even after considering symmetries", "nonisomorphic",...) --Shreevatsa 17:49, 6 January 2007 (UTC)
Isnt this in some way similiar to solving sudoku? Each row/column may only have one queen, is like every row may only have the same value once. Sould we include Sudoku in the Related Related Problems section? 81.221.196.70 14:17, 4 May 2007 (UTC)
I came to this page to learn about the problem and try to solve it myself (and to find out if a solution was possible). The solution appears right at the top, spoiling the puzzle for those who just want to try it. —Preceding unsigned comment added by 70.171.221.203 (talk) 22:44, 27 September 2007 (UTC)
217.208.53.194 added the following comment to the article. I'm moving it here. Michael Slone (talk) 13:55, 11 February 2008 (UTC)
Can anyone post the pseudocode version of the fastest algorithm that can find all unique solutions for n queens? 75.87.86.76 (talk) 23:05, 17 April 2008 (UTC)
its abt simetries... borderring n*n board to become (n+1)*(n+1) as a main backtracking step Hi, i think its a big challange 4 the analysts programmers to optimize the search 4 counting all solutions 4 n-queens problems , by using a hybrid technique between backtracking n divide and conquer, maybe counting more than one solution at a time... its still fuzzy to me im offering it to u as a challamge
— Preceding unsigned comment added by 93.118.212.93 (talk • contribs)
Currently under the section "Constructing a solution", it states:
I wonder if it would be better to write
Or would this just render it more obscure to a non-mathematical reader (especially one unfamiliar with the factorial)? − Twas Now ( talk • contribs • e-mail ) 01:23, 27 July 2008 (UTC)
an algo that might "capture" the "profile" of the part of bactracking type solution might count more than one solution at a time... — Preceding unsigned comment added by 93.118.212.31 (talk) 17:59, 24 July 2011 (UTC)
constrictive programming might help accelerate bactracking to produce the next solution more fast, in case we want to count them all...
anyway, i think it takes a bit of attention in order to make this really work
Florin Matei — Preceding unsigned comment added by 93.118.212.93 (talk) 11:05, 16 January 2012 (UTC)
In the aforementioned paragraph, it says that there are around 4 billion possible arrangements when in fact an 8x8 board has ~16 mil arrangements. Am I missing something? —Preceding unsigned comment added by ThisThat911 (talk • contribs) 17:35, 5 February 2009 (UTC)
The related article Eight queens puzzle solutions is being discussed for deletion here. Johnuniq (talk) 03:47, 12 August 2010 (UTC)
to give u trouble, lets say we got only small mem but we seek 4 bigger than mem possibilities n-queens solution, we might find usefull random generators or similaries to produce the brute solution of a slice of the board (virtual board)... in mem we might find usefull to note corrections from brute solutions.these brute solutions might b formed evn by markov sources like generators of numbers 93.118.212.93 (talk) 05:34, 24 August 2012 (UTC)
For random solutions, not to find total number of solutions. Is this of any interest? Points to "10000 Queens solved" by the website author himself. —Preceding unsigned comment added by Ronybc (talk • contribs) 21:28, 9 September 2010 (UTC)
Sosic and Gu solved a 3,000,000 Queens problem in 1991. See the article "3,000,000 Queens in Less Than One Minute", in ACM SIGART Bulletin, Volume 2, pages 22-24. PittBill (talk) 19:48, 11 September 2010 (UTC)
It should be noted somewhere inside that the N-Queens problem has a polynomial (and very quick) solution. I found it by accident, see http://doi.acm.org/10.1145/101340.101343
Neználek (talk) 13:00, 7 April 2011 (UTC)
GA toolbox |
---|
Reviewing |
Reviewer: J Milburn (talk · contribs) 15:30, 13 April 2012 (UTC)
Mine, review to follow soon. I'm a chess player, but not a mathematician. J Milburn (talk) 15:30, 13 April 2012 (UTC)
Ok, I'm afraid that this article has quite a long way to go before it's ready for good article status. The following are the pieces that you need to work on:
As this really needs to be completely rewritten to bring it in line with cited sources and place it in a more logical order, it doesn't really seem worth me going into any prose issues (though the article has clearly been written by several people- it lacks any kind of unity). As such, I'm going to have to fail the article at this point, as it needs significant work. I hope this is something you're willing to do- you may be able to find people willing to help at Wikipedia:WikiProject Mathematics or Wikipedia:WikiProject Chess. Good luck! J Milburn (talk) 15:56, 13 April 2012 (UTC)
if N is the size of the board, we might b able to use O(log(N)) complexity both code n data to describe fully the solutions that r more like independent of the size of the board, high... simetry lets call it :) 93.118.212.93 (talk) 05:39, 24 August 2012 (UTC)
Why would the 'Explicit' solution shown for n=8 not appear to be among the 'Unique' or 'fundamental' solutions?Cander0000 (talk) 03:51, 31 December 2012 (UTC)
The tabular in this article mentions for N=10 that there are 92 fundamental solutions. I just implemented this myself and can confirm all numbers from 1 to 9, but I get 96 fundamentals for N=10. Can someone confirm one or the other? — Preceding unsigned comment added by 94.218.43.105 (talk) 21:08, 28 November 2016 (UTC)
There should not be too much computer code added to the article, see MOS:CODE. In particular, "Multiple source code implementations are not appropriate ...". There is already one example, referenced to a classic book. No more should be added. Bubba73 You talkin' to me? 15:35, 17 July 2013 (UTC)
"Solution 10 has the additional property that no three queens are in a straight line.". Maybe I'm just missing something, but at least solution 9 has that property aswell.79.253.51.222 (talk) 22:56, 6 November 2015 (UTC)
if ((n mod 6) !== 2) AND ((n mod 6) !== 3)
then
call horse_step_algo()
function horse_step_algo() {
even numbers + odd numbers (2 4 6 8 10 12 1 3 5 7 9 11 13)
}
if N not in sequence http://oeis.org/A047243 , horse_step_algo() return solve.
n mod 6 -> 2017 mod 6 = 1 -> 2 4 6 8 10 ..... 2016 1 3 5 7 9 ..... 2017 solve.
Amanda Sproule (talk) 21:58, 10 December 2017 (UTC)
"Solution 10 has the additional property that no three queens are in a straight line."
Isn't that obvious, and shared by all solutions? If there were three queens in a straight line, they'd be threatening each other, and it wouldn't be a solution.
2605:A000:EF84:2C00:10C:6B90:8406:330B (talk) 23:20, 18 April 2017 (UTC)
This is unfortunately still unclear to me - most likely I am missing what is meant by "in a straight line"? When refering to cited article No-three-in-line problem it states: "no-three-in-line problem asks for the maximum number of points that can be placed in the n × n grid so that no three points are collinear. This number is at most 2n, since if 2n + 1 points are placed in the grid, then by the Pigeonhole principle some row and some column will contain three points." From this immediately follows, that a maximum number of 2 * 8 = 16 points (i.e. queens) can be placed on the common 8 × 8 chessboard, so that no row or column will contain 3 queens. But from "row or column" it also immediately follows for me in scope of the Eight queens puzzle, that not even *two* queens may share any row or column (and also not diagonal).
As already stated above I am obviously missing the definition of "straight line" in this context - as also mentioned by JBL above: "Not all lines are rows, columns, or diagonals." So what precisely *is* meant with "in a straight line" here? Maybe it would make sense to add that definition to the article, maybe even depicting the lines in one or all of the other 11 solutions, where three queens indeed are suppossed to be "in a straight line"? Dr.Big.Man (talk) 10:56, 9 January 2019 (UTC)
Our citation of Martin Richards' 1997 bit-patterns paper was of the 2009 online version (because that's easier to verify than the original 1997 paper version), but the 2009 date caused the contributor of this anonymous edit (from a ChinaNet IP in Chongqing) to think Zongyan Qiu's 2002 paper had it first. That would have been only a minor matter, until this anonymous edit (from Berea College, USA) changed the main text to read that Martin Richards plagiarised Zongyan Qiu. Plagiarism is a serious allegation for which we have no evidence (even if Richards' first version were 2009—which it wasn't—we still wouldn't know he'd deliberately copied Qiu; they might have just both thought of the same thing), so it's not surprising that User:Sneftel in this edit ("rm nn infighting") deleted the lot. Which is a pity, because it's notable that the algorithm can be done using bit patterns and has been since at least 1997. I therefore reinstated the text, noted the 1997, but still kept Zongyan Qiu's reference as well because I like Chinese and I'm not anti-Qiu or anything like that, but the facts are that Richards first did it in 1997, 5 years before Qiu. We can mention Qiu as well because it's a different publication and it takes a slightly different approach in a different programming language. Everyone happy now? ;-) A1415 (talk) 08:45, 12 April 2019 (UTC)
It was the allegation of plagiarism that brought the paragraph to my attention, but I removed the paragraph entirely rather than just reverting because the result did not seem particularly notable. I looked around for secondary references, and found a few "related work" mentions but nothing positioning it as an important aspect of the n-queens problem as a whole. Sneftel (talk) 11:40, 12 April 2019 (UTC)
A Google scholar search shows 9 citations for Richards, including:
Meanwhile there are 3 citations of Qiu, two of which are also in the above list of papers that cite Richards (so let's not double-count them), and the third is a conference paper called Research of Hybrid Genetic Algorithm in N-Queen Problem Based on HCI (with 2 citations).
Are these 10 citations enough to establish notability in some context? not sure if that context should be "the eight-queens puzzle" or bit manipulation though (although that article would need a lot more fleshing-out with applications etc before it would make sense to add this one). A1415 (talk) 08:46, 20 April 2019 (UTC)
References
I mean, clearly none of this is particularly notable, because none of us have gone to the trouble of noting it. You can count solutions through bitwise operations? Well that's potentially interesting if you're into bitwise operations, but in this discussion of wordings, nobody has tried to describe the method or argue that it is in any way important beyond the fact that someone gets to plant their flag in it. It doesn't help describe or explain or help people with the eight-queens puzzle. It's not notable to the eight-queens puzzle. It might be notable on Richards' or Qiu's articles since those are all about them, if it's among the more important things they did (though I doubt that's the case either). Sneftel (talk) 09:03, 25 April 2019 (UTC)
Counting solutions by bitwise operations is notable if someone published a paper about it, as they apparently did. There is also a paper about counting solutions through carry chains of hardware addition circuits.[2] This article should actually include a write-up of the algorithm they used to decrease counting time by making better use of symmetry when enumerating the 27 queens problem. 67.164.113.165 (talk) 00:13, 26 April 2019 (UTC)
In the solution to the Eight Queens section, it says that if you allow symmetry operations of rotations and reflections to be reduced to equivalence classes, you get 12 distinct solutions. I would like to point out that if, in addition, you allow translations, you can reduce the solution set to (at most) six equivalence classes. See this Problem of the Week at Math Help Boards that I posted for an explanation. We may or may not want to allow translations to reduce the solution set further, but I thought I would point this out. Ackbeet (talk) 17:18, 13 June 2019 (UTC)
The solutions have a certain order, but wouldn't it make more sense to show them in sequential order? I.e., decide on an order for the Quuens, say first from bottom to top, second from left to right [following the coordinate system]. Then solutions that have a Queen in the corner A1 appear first, then solutions with a Queen on B1, etc. If we use a coordinate system, we can use (c1,c2,c3,c4,...) to indicate that the n-th Queen is in the n-th row and cn-th column. The solutions should then be ordered as follows (using current numbering): 3 (1,2,4 - flipped), 2 (1,2,5 - flipped); 1 (2,4,6 - flipped), 4 (2,5,7,1), 5 (2,5,7,4), 6 (2,6,1), 7 (2,6,8), 8 (2,7,3), 9 (2,7,5); 12 (3,5,2), 10 (3,5,8), 11 (3,6,2). Considering that only 3 solutions are flipped and 10 solutions appear in the correct order, I assume that the shown order was not the one originally envisioned. Bcurfs (talk) 03:56, 16 November 2020 (UTC)
The superqueen problem adds the constraint of moving like a knight to the n-queens problem. Besides for the regular rook and bishop movement, it adds the knight movement making the puzzle much more difficult. I think it would make for a good addition to the article and I would do it myself, but I wouldn't be able to articulate it so well. It is only solvable for n = 1 | n >= 10 Here are some papers I found on the subject as well as the oeis sequence for it.
http://www.ccs.neu.edu/home/kunkle/papers/techreports/superQueensOG.pdf
http://www.durangobill.com/N_Queens.html
https://oeis.org/A051223
What of these recent set of articles on a "solution" by Harvard mathematician Michael Simkin?
This development should be in the article. I see Simkin mentioned only twice in the notes. TuckerResearch (talk) 18:48, 27 January 2022 (UTC)
So back in February Austinmohr removed the sourced sample code as "outdated and provid[ing] no insight". Subsequently, Majow has added it back -- except not actually, because what they've added is a rewritten version in a different language and with various changes made to the cited version. I was under the impression that this was something that's been discussed a lot here (in light of WP:OR and WP:CODE) but I'm either confused or incompetent because I don't see it on this page or in the article edit history. So let me try to kick off a discussion about it. Personally, I'm inclined towards the view that if we're going to include sample code, I would rather include a code sample directly cited to something, rather than reworked versions of it. --JBL (talk) 11:55, 17 April 2022 (UTC)
@Majow: What you called beautification in Special:Diff/1083937760 is IMO not an improvement at all. It only makes the rendering of the code block inconsistent with the rest of the Wikipedia. One could argue these borders with shadows are visually helpful, but these kind of style changes belong to the site-wide skin or templates. This code isn't particularly special in any way that would mandate making it look different here. – MwGamera (talk) 21:48, 22 April 2022 (UTC)
Just suggesting an extra column, symmetrical and fundamental solutions. For some reason I could not find this particular sequence in OEIS!
n | fundamental and symmetrical | fundamental | all |
---|---|---|---|
1 | 1 | 1 | 1 |
2 | 0 | 0 | 0 |
3 | 0 | 0 | 0 |
4 | 1 | 1 | 2 |
5 | 1 | 2 | 10 |
6 | 1 | 1 | 4 |
7 | 2 | 6 | 40 |
8 | 1 | 12 | 92 |
9 | 4 | 46 | 352 |
10 | 3 | 92 | 724 |
11 | 12 | 341 | 2,680 |
12 | 22 | 1,787 | 14,200 |
13 | 36 | 9,233 | 73,712 |
14 | 105 | 45,752 | 365,596 |
15 | 310 | 285,053 | 2,279,184 |
16 | 766 | 1,846,955 | 14,772,512 |
17 | 2,070 | 11,977,939 | 95,815,104 |
18 | 4,526 | 83,263,591 | 666,090,624 |
19 | 11,046 | 621,012,754 | 4,968,057,848 |
20 | 36,275 | 4,878,666,808 | 39,029,188,884 |
21 | 94,092 | 39,333,324,973 | 314,666,222,712 |
22 | 312,673 | 336,376,244,042 | 2,691,008,701,644 |
23 | 895,310 | 3,029,242,658,210 | 24,233,937,684,440 |
24 | 2,919,602 | 28,439,272,956,934 | 227,514,171,973,736 |
25 | 8,533,964 | 275,986,683,743,434 | 2,207,893,435,808,352 |
26 | 28,929,567 | 2,789,712,466,510,289 | 22,317,699,616,364,044 |
27 | 80,100,756 | 29,363,495,934,315,694 | 234,907,967,154,122,528 |
28 | 312,733,584 | ??? | ??? |
29 | 900,029,716 | ??? | ??? |
30 | 3,647,359,506 | ??? | ??? |
█████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████ |
█████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████ |
█████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████ |
█████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████ |
█████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████ |
█████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████ |
█████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████ |
█████████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████████ |
█████████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████████ |
█████████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████████ |
█████████████████████████████████████████████████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████████████████████████████████████████████████ |
… |
█████████████████████████████████████████████████████████████████████████████████████ ██┏━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┳━━━┓██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┣━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━╋━━━┫██ ██┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃███┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃ ┃██ ██┗━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┻━━━┛██ █████████████████████████████████████████████████████████████████████████████████████ |
AndrejPodzimek (talk) 00:22, 19 May 2022 (UTC)