kimapr's code guessing stats

name	correct guesses	games together	ratio
seshoumara	5	5	1.000
olive	7	8	0.875
Palaiologos	3	4	0.750
moshikoi	5	10	0.500
luatic	9	18	0.500
rrebbbbeca	2	4	0.500
olus2000	9	19	0.474
ponydork	2	5	0.400
oleander	4	10	0.400
theqwertiest	2	5	0.400
Dolphy	7	18	0.389
LyricLy	10	26	0.385
Olivia	4	11	0.364
essaie	5	14	0.357
yeti	2	6	0.333
JJRubes	2	6	0.333
taswelll	3	11	0.273
chirk	3	13	0.231
soup girl	1	5	0.200
Moja	1	7	0.143
yui	1	8	0.125
hyacinth	0	5	0.000
Makefile_dot_in	0	6	0.000
ultlang	0	4	0.000
razetime	0	7	0.000
at	0	4	0.000

name	correct guesses	games together	ratio
olive	7	8	0.875
luatic	12	18	0.667
Dolphy	12	19	0.632
rrebbbbeca	3	5	0.600
yui	4	8	0.500
LyricLy	13	26	0.500
Olivia	5	11	0.455
razetime	3	7	0.429
hyacinth	2	5	0.400
seshoumara	2	5	0.400
essaie	5	14	0.357
moshikoi	3	10	0.300
Moja	2	7	0.286
Makefile_dot_in	2	7	0.286
chirk	3	11	0.273
oleander	3	11	0.273
olus2000	5	19	0.263
theqwertiest	1	5	0.200
taswelll	2	11	0.182
JJRubes	1	6	0.167
ponydork	0	5	0.000
yeti	0	4	0.000
Palaiologos	0	4	0.000
ultlang	0	4	0.000
at	0	4	0.000

const target = 'https://codeguessing.gay/84/';
const reset = `${target}_verify/reset`;
const opts = { headers: { 'Accept': 'text/html' } };

if (!('window' in globalThis)) {
    fetch = require("fetch-cookie").default(fetch);
}

class ReadIterator {
    reader;

    constructor(readableReader) {
        this.reader = readableReader;
    }

    [Symbol.asyncIterator]() {
        return this;
    }

    async return() {
        this.reader.releaseLock();
    }

    async next() {
        return this.reader.read();
    }
}

async function scrape() {
    let response = await fetch(target, opts).then(res => res.text());

    if (!response.match(/anti-scraper protection.*\n.*meta http-equiv="refresh"/)) {
        return response;
    }

    response = '';
    let reader = new ReadIterator(await fetch(target, opts).then(res => res.body.getReader()));
    let decoder = new TextDecoder();
    let key;

    for await (let chunk of reader) {
        let m;
        if (!key) {
            response += decoder.decode(chunk);
            m = response.match(/a href=(\/84\/_verify\/[^ ]*)[^<]*verify/i);
        }

        if (m) {
            key = m[1];
            await fetch(new URL(key, target), opts);
        }
    }

    response = await fetch(target, opts).then(res => res.text());

    if (reset)
        fetch(reset).catch(() => {});

    return response;
}

scrape().then(console.log);

for line in io.lines(...) do
	local mines, msep
	local orig_line = line
	mines, msep, line = line:match('^(%d+)( *|)(.*)$')
	mines = tonumber(mines) or -1
	msep = msep or ""
	line = line or ""
	local off = #(mines .. msep)
	local grid = {}
	for i = 1, #line do
		local c = line:sub(i,i)
		if c == '-' or (tonumber(c) and tonumber(c) <= 2) then
			grid[#grid+1] = {
				off = off + i - 1,
				val = c ~= '-' and tonumber(c),
				mine_hits = 0,
				total_hits = 0,
				local_mines = 0,
				local_hits = 0
			}
		end
	end
	grid.total_hits = 0
	grid.mine_hits = 0
	grid.mines = mines
	local mutagen = {}
	local function writer()
		local off = 0
		return function (x, c)
			c = tostring(c)
			assert(x >= off)
			io.write((' '):rep(x - off), c)
			off = x + #c
		end
	end
	local function postrecur()
		local sels = {}
		for i, v in ipairs(grid) do
			if grid[i].local_mines == 0 and grid[i].local_hits > 0 then
				sels[i] = true
			end
		end
		for i, v in ipairs(grid) do
			if grid[i].local_mines == grid[i].local_hits or (sels[i] and not sels[i]) then
				grid.total_hits = grid.total_hits - grid[i].total_hits
				grid.mine_hits = grid.mine_hits - grid[i].mine_hits
				grid[i].mine_hits = 0
				grid[i].total_hits = 0
			end
		end
	end
	local function recursor(len, mines)
		local function mutaget(i)
			if i > len or i < 1 then return 0 end
			return mutagen[i] and 1 or 0
		end
		local function mutacheck(i)
			if i > len or i < 1 then return true end
			if not (grid[i] or {}).val then return true end
			return mutaget(i - 1) + mutaget(i + 1) == grid[i].val
		end
		if mines < 0 or not mutacheck(len - 1) then
			return
		end
		if len == #grid then
			if mines > 0 or not mutacheck(len) then
				return
			end
			local unknown = 0
			for i = 1, len do
				if not grid[i].val then
					unknown = unknown + 1
				end
			end
			if unknown > grid.mines then
				for i = 1, len do
					grid[i].local_hits = grid[i].local_hits + 1
					grid[i].local_mines = grid[i].local_mines + (mutagen[i] and 1 or 0)
					if mutagen[i] then
						grid.total_hits = grid.total_hits + 1
						grid.mine_hits = grid.mine_hits + 1
						grid[i].mine_hits = grid[i].mine_hits + 1
						grid[i].total_hits = grid[i].total_hits + 1
					elseif not grid[i].val then
						local oldgrid = grid
						grid = {}
						for i, v in ipairs(oldgrid) do
							grid[i] = {
								val = v.val,
								off = v.off,
								mine_hits = 0,
								total_hits = 0,
								local_mines = 0,
								local_hits = 0
							}
						end
						grid.total_hits = 0
						grid.mine_hits = 0
						grid.mines = oldgrid.mines
						local function reveal(i)
							if i > len or i < 1 then return false end
							if mutaget(i) > 0 then return end
							if grid[i].val then return false end
							grid[i].val = mutaget(i - 1) + mutaget(i + 1)
							if grid[i].val == 0 then
								reveal(i - 1)
								reveal(i + 1)
							end
							return true
						end
						reveal(i)
						local oldmutagen = mutagen
						mutagen = {}
						recursor(0, grid.mines)
						postrecur()
						oldgrid[i].mine_hits = oldgrid[i].mine_hits + grid.mine_hits
						oldgrid[i].total_hits = oldgrid[i].total_hits + grid.total_hits
						oldgrid.mine_hits = oldgrid.mine_hits + grid.mine_hits
						oldgrid.total_hits = oldgrid.total_hits + grid.total_hits
						grid = oldgrid
						mutagen = oldmutagen
						unknown = unknown + 1
					end
				end
			else
				grid.total_hits = grid.total_hits + 1
			end
			return
		end
		local i = len + 1
		if not grid[i].val then
			mutagen[i] = true
			recursor(i, mines - 1)
		end
		mutagen[i] = false
		return recursor(i, mines)
	end
	recursor(0, mines)
	postrecur()
	if grid.total_hits == 0 then
		print('invalid board')
	else
		local minimum = math.huge
		for i = 1, #grid do
			if grid[i].mine_hits/grid[i].total_hits < minimum and not grid[i].val then
				minimum = grid[i].mine_hits / grid[i].total_hits
			end
		end
		local function stty(isterm, term)
			if isterm ~= nil then return isterm end
			isterm = os.execute('stty <&'..(term or 0)..' >/dev/null 2>&1')
			if tonumber(isterm) then isterm = tonumber(isterm) == 0 end
			return isterm
		end
		isterm_in = stty(isterm_in, 0)
		isterm_out = stty(isterm_out, 1)
		if isterm_out and not isterm_in then
			io.stderr:write(orig_line .. "\n")
			io.stderr:flush()
		end
		local write = writer()
		for i = 1, #grid do
			if grid[i].mine_hits/grid[i].total_hits == minimum and not grid[i].val then
				write(grid[i].off, '^')
			end
		end
		print(('  %.1f%%'):format(math.floor((1-minimum)*1000+.5)/10))
	end
end

// ==ByteBeat==
// @mode funcbeat
// @freq 44100
//       ^^^ in bytebeat-composer,
//           use 48kHz instead
// @len 5780275
// @dcClean no
// @term 80x13
// ==/ByteBeat==

l=131.072,fnv=(v,h,p)=>(v|=0,v%=500*l,v?(h=0x811c9dc5,p=0x1000193,
h^=(v>> 0)&0xff,h=(h-(1<<31))*p,h^=(v>> 8)&0xff,h=(h-(1<<31))*p,
h^=(v>>16)&0xff,h=(h-(1<<31))*p,h^=(v>>24)&0xff,h=(h-(1<<31))*p,
h=((h|0)-(1<<31))/2**32*2-1):0);ip=(c,d,x)=>(x=max(0,min(1,x))**2,
c+(x*x*x*(x*(6*x-15)+10))*(d-c));vnoise=(x,X,Y)=>(
X=fnv(floor(x)),Y=fnv(ceil(x)),ip(X,Y,x%1));
disp=(t,w,h,d)=>{throw w=80,h=12,d=[...Array(w)]
.map((_,i)=>floor((vnoise(max(2,floor(t*500/16))
*16-(w-1-i)/w*32)+1)/2*h)),'\n'+[...Array(h)]
.map((_,i)=>d.map(e=>((e<i)?'|':((e==i)?'O':'.'))).join(''))
.join('\n')+`\n[${[Array(round(t%l/l*78)).fill('=').join('')
+Array(78-round(t%l/l*78)).fill('-').join('')]}]`};
return t => t*100%1?vnoise(t*500):disp(t);

                           Object              =                                  {        assign                          =    function(  
                             dst                  ,                            src              )                       for           k    
                             ,                      v                          in            pairs(                    src             )   
                          do                        dst                       [                    k                    ]               =  
                        v                             end                  end                     };            function             OOB( 
                 boulder                                )              local                         w              =                  love
                  .                               graphics             .                    getWidth()         local                      h
              =                                       love           .                        graphics         .                getHeight()
          for                                           n         =                                  1       ,                            #
       boulder                                         ,        2                                  do      if                      boulder 
     [                                                n       ]                                   >=     0                            and  
  boulder                                           [       n                                    ]      <=                             w   
 and                                          boulder      [                                    n      +                              1    
]                                              <=         h                                 then      return                      false    
end                                         end           return                           true       end                       function   
drawBoulder(                             body             ,                              ...          )                         love       
 .                                    graphics             .                          polygon(         "fill"                   ,          
   ...                                )                     if                        body              :                    getType()     
     ==                            "dynamic"                  and                    OOB                 {                    ...          
        }                         then                        toDestroy             [                     body               ]             
           =                      true                            end              end                      print(          "meow\n"       
              )                  function                 checkBoulderDestructure( boulder                     ,            impulse        
                  )              if                                 boulder        :                         getType()      ~=             
                "dynamic"         then                                return       end                             if       32000          
                       /(         boulder                                   :       getMass())                        <      impulse       
                        then       destructures                               [      boulder                            ]     =            
                          true        end                                     end    function                  destructure(    b           
                               )       local                                   b2s      =                                {}    local       
                                r          =                                      b       :                   getFixtures()[      1        
                               ]:      getUserData()                              /         2                          local     bins      
                                =              {                                  b           :              getWorldPoints(        -      
                               r                  /                              2              ,                         -           r    
                             /                      2                           ,                -                       r             /   
                           2                          ,                       r                    /                    2               ,  
                        r                              /                    2                       ,                 -                  r 
                     /                                  2                 ,                          r              /                     2
                  ,                                      r             /                             2           )}                     for
              n                                          =           1                               ,         #                       bins
           ,                                            2         do                             local       b2                           =
       love                                            .       physics                              .     newBody(                   world 
     ,                                             bins       [                                    n     ],                           bins 
   [                                                n       +                                    1      ],                       "dynamic" 
 )                                               b2        :                              setAngle(    b                              :    
getAngle())                                    b2         :                         setLinearVelocity(b                             :      
getLinearVelocityFromWorldPoint(            bins          [                                 n         ],                          bins     
[                                          n              +                               1           ]))                        b2        
 :                                 setAngularVelocity(     b                            :             getAngularVelocity())     b2s        
   [                                  #                     b2s                        +                1                      ]           
     =                              b2                       local                   f                   =                   love          
        .                         physics                       .                   newFixture(            b2                ,             
          love                    .                             physics            .                   newRectangleShape(   r              
              ,                  r                                  ),             1                           )            f              
                  :              setUserData(                          r           )                              f         :              
              setFriction(        0.9                                     )        end                              b       :              
                  destroy()       return                                  b2s       end                         function    findBody(      
                           x        ,                                         y      )                                for     _            
                             ,        b                                        in    ipairs(                         world     :           
                    getBodies())        do                                     for      _                                 ,     f          
                               in       ipairs(                                   b       :                   getFixtures())     do        
                               if            f                                    :    testPoint(                          x       ,       
                                y              )                               then        return                          b       end     
                             end                end                            end          Object                        .       assign(  
                          love                      ,                           {              load                      =      function() 
                       world                          =                     love                   .               physics              .  
                  newWorld(                            0                    ,                     800                );             ground 
                     =                               love                 .                    physics              .              newBody(
               world                                     ,            love                           .        graphics                    .
          getWidth()                                     /           2                               ,        love                        .
         graphics                                       .      getHeight()                           +       100                          ,
      "static"                                         )       love                                 .     physics                        . 
    newFixture(                                   ground      ,                                 love     .                         physics 
   .                                   newRectangleShape(   love                                 .     graphics                        .   
 getWidth()                                       *        2                                    ,      200                           ),    
1                                              ):         setFriction(                       0.9      )                           world    
:                                      setCallbacks(      nil                               ,         nil                          ,       
nil                                        ,              function(                       a           ,                           b        
 ,                                      _                  ,                            ...            )                       local       
   imps                               =                     {                         ...               }                     local        
     imp                            =                         0                      for                 n                    =            
        1                          ,                            #                   imps                   ,                 2             
           do                     imp                             =                math                      .              max(           
             imp                 ,                                 imps            [                           n            ])             
                 end             checkBoulderDestructure(              a           :                         getBody(),     imp            
                     )           checkBoulderDestructure(                 b        :                          getBody(),    imp            
                        )         end                                       )       end                               ,      update        
                           =       function(                                 dt      )                                 if    mouseJoint    
                           and      mouseJoint                                  :   isDestroyed()                     then   mouseJoint    
                               =        nil                                    end      if                       mouseJoint    then        
                            local         mx                                      ,       my                               =    love       
                                .          mouse                                  .   getPosition()                       if    paused     
                             then            local                               jx           ,                           jy        =      
                      mouseJoint                  :                    getTarget()           local                        b           =    
                     mouseJoint                     :                  getBodies()            local                      x             ,   
                           y                          =                       b                    :          getPosition()             b  
                        :                    setPosition(                   x                       +                mx                  - 
                    jx                                  ,                 y                          +             my                     -
                 jy                                      )            end                   mouseJoint            :              setTarget(
              mx                                         ,          my                               )         end             destructures
           =                                           {}         if                               not      paused                     then
       world                                           :      update(                              dt      )                           end 
     for                                              b       ,                                    _     in                         pairs( 
  destructures                                      )       do                                  for     _                              ,   
 b                                               in        ipairs(                      destructure(   b                             ))    
do                                       destructure(     b                                   )       end                          end     
if                                       mouseJoint       and                           mouseJoint    :                      isDestroyed() 
then                                   mouseJoint         =                              nil          end                        end       
 ,                                   mousepressed          =                          function(        x                        ,          
   y                                  ,                     k                          )                local                 body         
     =                             findBody(                  x                      ,                   y                    )            
        if                         k                            ==                  2                      and               body          
          then                   toJoint                          =                body                    preJoint         =              
             love                .                                physics          .                      newMouseJoint(    body           
                  ,              x                                     ,           y                              )         toJx           
                     =            x                                     toJy       =                                y       end            
                       if          k                                       ~=       1                               then     return        
                         end        if                                      not      body                            then    body          
                             =       love                                       .    physics                             .   newBody(      
                           world        ,                                        x      ,                                 y     ,          
                        "dynamic"          )                                  local       f                                =    love       
                                .         physics                                 .    newFixture(                      body       ,       
                             love              .                            physics           .           newRectangleShape(        60     
                               ,                 60                             ),              1                         )           f    
                             :             setUserData(                        60                )                       f             :   
                  setFriction(                      0.9                       )                  end                   if       mouseJoint 
                      then                     mouseJoint                   :               destroy()               end          mouseJoint
                     =                               love                 .                    physics              .        newMouseJoint(
                body                                     ,             x                             ,            y                       )
             end                                         ,       keypressed                          =      function(                     k
           )                                           if         k                                 ==     "space"                     then
       paused                                          =        not                            paused      end                         end 
     ,                                     mousereleased      =                             function(    x                              ,  
   y                                                ,       k                                    )      if                             k   
 ==                                               2        and                             toJoint     then                        local   
body2                                          =          findBody(                           x       ,                             y      
)                                          local          body                              =         toJoint                      if      
toJoint                                    :              isDestroyed()                  then         preJoint                    =        
 nil                                  toJoint              =                            nil            toJx                     =          
   nil                               toJy                   =                         nil               end                   toJoint      
     =                              nil                      local                   x2                  ,                    y2           
        =                         toJx                          ,                   toJy                   toJx              =             
          nil                     toJy                            =                nil                     preJoint         :              
           destroy()             preJoint                            =             nil                         if(          not            
               body2             )                                     or          body2                         ==         body           
                   then          body2                                    =        ground                         end       love           
                        .         physics                                   .      newDistanceJoint(               body      ,             
                       body2        ,                                        x2      ,                                 y2     ,            
                             x        ,                                         y      ,                              true     )           
                             end        if                                       k      ~=                                1    then        
                           return         end                                    if    mouseJoint                       then  mouseJoint   
                                :        destroy()                       mouseJoint         =                            nil      end      
                              end              ,                               draw           =                   function()       love    
                               .             graphics                            .          clear(                        0           ,    
                             0                      ,                           1                )                    love             .   
                     graphics                         .                setColor(                   1                    ,               1  
                        ,                              1                    )               toDestroy                 =                 {} 
                  local                              seenj                =                         {}            for                     _
                  ,                                      b             in                      ipairs(         world                      :
         getBodies())                                   do          for                              _         ,                          f
           in                                      ipairs(        b                                  :   getFixtures())                  do
        if                                             f        :                         getShape():    getType()                      == 
    "polygon"                                      then     drawBoulder(                           b     ,                              b  
   :                                     getWorldPoints(    f                                    :     getShape():            getPoints()))
 end                                            end        end                                love     .                         graphics  
.                                          setColor(      0.5                                 ,       0.5                           ,      
0.5                                          )            if                             toJoint      and                         not      
toJoint                                    :              isDestroyed()                  then         love                        .        
 graphics                               .                  line(                       toJx            ,                       toJy        
   ,                                 love                   .                         mouse             .                   getPosition()) 
     end                            for                       _                      ,                   b                    in           
       ipairs(                    world                         :                  getBodies())            do                for           
           _                      ,                               j                in                      ipairs(          b              
              :                  getJoints())                       do             if                          j            :              
             getType()           ==                               "distance"       and                          not         seenj          
                     [            j                                       ]        then                          seenj      [              
                        j          ]                                        =       true                           love      .             
                     graphics       .                                      line(     j                                  :   getAnchors())  
                           end        end                                     end     local                           seen     =           
                              {}       local                                  todo      =                                {}     for        
                                _          ,                                      b       in                          pairs(    world      
                                :      getBodies())                              do        for                             _       ,       
                                j              in                           ipairs(           b                            :  getJoints()) 
                              do                 if                              j              :                 getType()          ==    
                        "mouse"                   then                  toDestroy                [                       b             ]   
                           =                        nil                    break                 end                  end              if  
                       not                      toDestroy                   [                       b                 ]               then 
                   todo                                 [                 b                          ]              =                  true
                seen                                     [             b                             ]            =                    true
             end                                       end         while                         next(        todo                        )
           do                                        local       ntodo                               =       {}                         for
        b                                              ,        _                                  in     pairs(                      todo 
     )                                               do       for                                  _     ,                              j  
   in                                           pairs(      b                                    :     getJoints())                   do   
 for                                              _        ,                                   b2      in                        ipairs({  
j                                              :          getBodies()})                      do       if                           not     
seen                                         [            b2                                ]         then                       ntodo     
[                                         b2              ]                               =           true                    toDestroy    
 [                                      b2                 ]                            =              nil                     seen        
   [                                  b2                    ]                          =                true                  end          
     end                            end                       end                    todo                =                   ntodo         
        end                       for                           b                   ,                      _                 in            
         pairs(                  toDestroy                        )                do                        b              :              
           destroy()             end                             toDestroy         =                           nil          end            
                  ,              });

// You can try this online at https://bytebeat.ficial.net/
// Use Funcbeat playback mode

str="Hello, World!"; // <-- your data here

t=[["A",".-"],["B","-..."],["C","-.-."],["D","-.."],["E","."],
["F","..-."],["G","--."],["H","...."],["I",".."],["J",".---"],
["K","-.-"],["L",".-.."],["M","--"],["N","-."],["O","---"],
["P",".--."],["Q","--.-"],["R",".-."],["S","..."],["T","-"],
["U","..-"],["V","...-"],["W",".--"],["X","-..-"],["Y","-.--"],
["Z","--.."],["0","-----"],["1",".----"],["2","..---"],
["3","...--"],["4","....-"],["5","....."],["6","-...."],
["7","--..."],["8","---.."],["9","----."],["&",".-..."],
["'",".----."],["@",".--.-."],[")","-.--.-"],["(","-.--."],
[":","---..."],[",","--..--"],["=","-...-"],["!","-.-.--"],
[".",".-.-.-"],["-","-....-"],["×","-..-"],["x","-..-"],
["%","------..-.-----"],["+",".-.-."],['"',".-..-."],
["?","..--.."],["/","-..-."],["\n",".-.-"],[" "," "]];
t=Object.fromEntries(t.map(([k,v])=>[k,[...v]
.map(c=>(({'-':'111','.':'1',' ':'0'})[c])).join('0')]));
l=[...str.toUpperCase()].map(c=>t[c]).join('000');
return (T,f)=>(d=1/16,i=T*12+d/2,p=min(1,(i)%1/d),
((+(l[int(i)-1]??0))*(1-p)+(+(l[int(i)]??0))*(p))
*(sin(T*440*PI*2)*0.5))

<!-- best played on computer, sorry phone prisoners -->

<style>

html, body { margin: 0; padding: 0; }
body {
  background-color: black;
  width:100vw; height: 100vh;
  overflow: hidden;
  position: relative;
}
body[paused] {
  background-color: #111;
}
.star {
  background-color: #fff;
}
.fire {
  border: 1px solid red;
}
.sel {
  border: 1px solid cyan;
}
.fire, .star, .sel {
  border-radius: 100%;
  position: absolute;
}

</style>

<body id="body">

<script>

var datakey = "$XDG_CONFIG_DIR/CG79/entry.html.conf";
var config = {
  camX: 0,
  camY: 0,
  zoom: 1,
  speed: 1,
  objects: {},
  pause: false,

  ...(localStorage[datakey]
    ? JSON.parse(localStorage[datakey])
    : {})
};

Object.values(config.objects)
  .forEach(obj => starElement(obj));

function saveConfig() {
  localStorage[datakey] = JSON.stringify({
    ...config,

    objects: Object.fromEntries(
      Object.entries(config.objects)
        .map(([k, v]) => [k, Object.fromEntries(
          Object.entries(v)
            .filter(([k, v]) => k != 'element')
        )])
    )
  });
}

setInterval(_ => saveConfig(), 100);

var newObj = null;
var throwObj = null;
var selObj = null;

function screenToWorld(cx, cy) {
  var    [w,  h ] = [body.clientWidth, body.clientHeight];
  var    [wx, wy] = [cx - w/2,         cy - h/2         ];
         [wx, wy] = [wx / h,           wy / h           ];
         [wx, wy] = [wx / config.zoom, wy / config.zoom ];
         [wx, wy] = [wx + config.camX, wy + config.camY ];
  return [wx, wy]                                        ;
}

function worldToScreen(wx, wy) {
  var    [w,  h ] = [body.clientWidth, body.clientHeight];
  var    [cx, cy] = [wx - config.camX, wy - config.camY ];
         [cx, cy] = [cx * config.zoom, cy * config.zoom ];
         [cx, cy] = [cx * h,           cy * h           ];
         [cx, cy] = [cx + w/2,         cy + h/2         ];
  return [cx, cy]                                        ;
}

function randomID() {
  return [...crypto.getRandomValues(new Uint8Array(2))]
    .map(e => e.toString(16).padStart(2, 0))
    .join('');
}

function reset() {
  localStorage[datakey] = '{}';
  saveConfig = function() {};
  location.reload();
}

randomID = (function(randomID) {
  return function() {
    if (Object.keys(config.objects).length >= (256 ** (randomID().length / 2)) * 0.8) {
      body.remove();
      localStorage[datakey] = '{}';
      document.innerHTML = `<body>You're cringe</body>`;
      throw new Error(document.textContent);
    }
    while (1) {
      var id = randomID();
      if (!(id in config.objects))
        return id;
    }
  }
})(randomID);

function starElement(obj) {
  if ((!obj.element) || obj.element.parentElement != body) {
    obj.element = document.createElement('div');
    obj.element.className = obj.sel ? 'sel' : (obj.obj ? 'fire' : 'star');
    body.append(obj.element);
  }
  var [
    sx, sy
  ] = worldToScreen(obj.x, obj.y);
  var [
    sx2,
    sy2
  ] = worldToScreen(
    obj.x + obj.r,
    obj.y + obj.r,
  );
  obj.element.style.width = '1000px';
  obj.element.style.height = '1000px';
  obj.element.style.top = '-500px';
  obj.element.style.left = '-500px';
  obj.element.style.transform = `translate(${sx}px, ${sy}px) scale(${(sx2 - sx)/500}, ${(sy2 - sy)/500})`;
  return obj;
}

var targetStep = 1/120;
var accumTime = 0;
var maxSteps = 1;
var updateTime = 0;

function draw(dt) {
  dt *= config.speed;
  if (updateTime / dt > 0.8) {
    maxSteps = Math.max(1, maxSteps - 1);
  } else {
    maxSteps = maxSteps + 1;
  }

  accumTime += dt;
  accumTime = Math.min(accumTime, 5);

  var begin = performance.now();
  for (var i = 0; i < maxSteps && accumTime >= targetStep; i++) {
    update(targetStep);
    accumTime -= targetStep;
  }

  updateTime = performance.now() - begin;

  [
    ...(newObj ? [newObj] : []),
    ...(throwObj ? [throwObj] : []),
    ...(selObj ? [selObj] : []),
    ...Object.values(config.objects)
  ]
    .forEach(e => starElement(e));
}

function gravity(dest, src, out) {
  if (dest.mass == 0 || src.mass == 0)
    return;
  var G = 10; // cartoon physics
  var r = Math.hypot(
    dest.x - src.x,
    dest.y - src.y
  );
  if (r < (dest.r + src.r)) {
    G = 0;
    let objs = [dest, src].sort((a, b) => a.mass - b.mass);
    [objs[0].x, objs[0].y, objs[0].vx, objs[0].vy] = [
      (dest.x * dest.mass + src.x * src.mass) / (src.mass + dest.mass),
      (dest.y * dest.mass + src.y * src.mass) / (src.mass + dest.mass),
      (dest.vx * dest.mass + src.vx * src.mass) / (src.mass + dest.mass),
      (dest.vy * dest.mass + src.vy * src.mass) / (src.mass + dest.mass),
    ];
    [objs[0].r, objs[0].mass] = [
      (((4/3)*Math.PI*(src.r**3) + (4/3)*Math.PI*(dest.r**3)) / (4/3*Math.PI)) ** (1/3),
      src.mass + dest.mass
    ];
    [src.anchor, dest.anchor] = [0,0].map(_ => src.anchor && dest.anchor);
    if (!src.anchor) delete src.anchor;
    if (!dest.anchor) delete dest.anchor;
    objs[1].r = 0;
    objs[1].mass = 0;
    delete config.objects[objs[1].id];
    objs[1].element.remove();
  }
  var [dx, dy] = [
    src.x - dest.x,
    src.y - dest.y
  ];
  var d = Math.hypot(dx, dy);
  [dx, dy] = [
    dx / d,
    dy / d
  ];
  out[0] += G * (dest.mass * src.mass) / (r**2) * dx / dest.mass;
  out[1] += G * (dest.mass * src.mass) / (r**2) * dy / dest.mass;
}

function update(dt) {
  if (throwObj || newObj || config.pause) {
    body.setAttribute('paused', '');
    return;
  } else {
    body.removeAttribute('paused');
  }

  // 4th order Yoshida integrator
  var w0 = -(2**(1/3))/(2-(2**(1/3))),
      w1 = 1/(2-(2**(1/3))),
      c1, c2, c3, c4,
      d1, d2, d3, a;
      c1 = c4 = w1 / 2;
      c2 = c3 = (w0 + w1) / 2;
      d1 = d3 = w1;
      d2 = w0;

  var c = [,c1,c2,c3,c4];
  var d = [,d1,d2,d3];

  let objs = Object.values(config.objects)
    .filter(obj => (
      +obj.x == obj.x &&
      +obj.y == obj.y &&
      +obj.r == obj.r &&
      +obj.mass == obj.mass &&
      +obj.vx == obj.vx &&
      +obj.vy == obj.vy
    ));

  for (let k = 1; k <= 4; k++) {
    for (let obj of objs) {
      if (c[k]) {
        [obj.x, obj.y] = [
          obj.x + c[k]*obj.vx*dt,
          obj.y + c[k]*obj.vy*dt,
        ];
      }
      if (d[k]) {
        let a = [0, 0];
        for (let alt of objs) {
          if (alt != obj) {
            gravity(obj, alt, a);
          }
        }
        [obj.vx, obj.vy] = [
          obj.vx + d[k]*a[0]*dt,
          obj.vy + d[k]*a[1]*dt,
        ];
      }
    }
  }

  let objs2 = objs.filter(obj => obj.anchor);

  if(objs2.length == 0) {
    objs2 = objs;
  }

  let av = [0, 0, 0, 0, 0];
  for (let obj of objs2) {
    if (obj.mass > 0) {
      av[0] += obj.vx * obj.mass;
      av[1] += obj.vy * obj.mass;
      av[2] += obj.mass;
      av[3] += obj.x * obj.mass;
      av[4] += obj.y * obj.mass;
    }
  }
  av = [av[0] / av[2], av[1] / av[2], av[3] / av[2], av[4] / av[2]];
  for (let obj of objs) {
    obj.vx -= av[0];
    obj.vy -= av[1];
    obj.x -= av[2];
    obj.y -= av[3];
  }
  config.camX -= av[2];
  config.camY -= av[3];
  if (objs2.length == 0 || !(
    +config.camX == config.camX &&
    +config.camY == config.camY &&
    +config.zoom == config.zoom
  )) {
    config.camX = 0;
    config.camY = 0;
    config.zoom = 1;
  }
}

Object.assign(body, {

  onkeydown(e) {
    if (e.code == 'Space') {
      config.pause = !config.pause;
    }
  },

  oncontextmenu(e) {
    return false;
  },

  onmousedown(e) {
    let [x, y] = screenToWorld(e.clientX, e.clientY);

    if (e.button == 1) {

      selObj = starElement({x, y, r:0, sel:1});
      return false;

    } else if (e.button == 0) {

      for (let obj of Object.values(config.objects)) {
        if (Math.hypot(obj.x - x, obj.y - y) <= obj.r) {
          if (throwObj) {
            throwObj.element.remove();
          }
          throwObj = starElement({x, y, r: 0, dx: 0, dy: 0, obj});
          return false;
        }
      }

      newObj = starElement({
        x, y, r: 0, mass: 0,
        id: randomID(),
        vx: 0, vy: 0,
      });

      return false;

    } else if (e.button == 2) {

      for (let obj of Object.values(config.objects)) {
        if (Math.hypot(obj.x - x, obj.y - y) <= obj.r) {
          obj.element.remove();
          delete config.objects[obj.id];
          return false;
        }
      }

    }
  },

  onmousemove(e) {
    let [x, y] = screenToWorld(e.clientX, e.clientY);

    if (selObj) {
      selObj.r = Math.hypot(x - selObj.x, y - selObj.y);
    }

    if (newObj && !throwObj) {
      newObj.r = Math.hypot(x - newObj.x, y - newObj.y);
      newObj.mass = 4/3 * Math.PI * (newObj.r**3);

      return false;

    } else if (throwObj) {

      Object.assign(throwObj, {
        dx: x - throwObj.x, dy: y - throwObj.y, r: Math.hypot(x - throwObj.x, y - throwObj.y),
      });

      return false;
    }
  },

  onmouseup(e) {
    if (newObj && e.button == 0) {
      if (newObj.r > 0) {
        config.objects[newObj.id] = newObj;
      } else {
        newObj.element.remove();
      }
      newObj = null;

      return false;
    } else if (throwObj && e.button == 0) {
      [throwObj.obj.vx, throwObj.obj.vy] = [
        throwObj.dx,
        throwObj.dy,
      ];
      throwObj.element.remove();
      throwObj = null;
    } else if (selObj && e.button == 1) {
      for (let obj of Object.values(config.objects)) {
        if (Math.hypot(obj.x - selObj.x, obj.y - selObj.y) < (obj.r + selObj.r)) {
          obj.anchor = true;
        } else {
          delete obj.anchor;
        }
      }
      selObj.element.remove();
      selObj = null;
    }
  },

  onwheel(e) {
    let [x, y] = screenToWorld(e.clientX, e.clientY);

    let [dx, dy] = [
      x - config.camX,
      y - config.camY,
    ];

    let oldzoom = config.zoom;
    config.zoom -= (e.deltaY / body.clientHeight) * config.zoom;
    let zch = config.zoom / oldzoom;

    config.camX = x - dx / zch;
    config.camY = y - dy / zch;
  },

});

var prevAniTs;

requestAnimationFrame((fun => fun = (ts) => {
  draw((prevAniTs != null) ? Math.min((ts - prevAniTs) / 1000, 1) : 0);
  prevAniTs = ts;
  requestAnimationFrame(fun);
})());

</script>

from learner import Learner
import torch
import random

# train the gamer

W = 10
H = 10

class HalfBattleship:
    def __init__(self):
        self.W = W
        self.H = H
        self.board = [None for i in range(W*H)]
        self.hits = [None for i in range(W*H)]
        self.pieces = []
        for l in [2,3,4,5,6]:
            while True:
                h = random.randint(0, 1) == 1
                if h:
                    x = random.randrange(0, self.W - l + 1)
                    y = random.randrange(0, self.H)
                    row = [(x+dx,y)
                           for dx in range(0, l)]
                else:
                    x = random.randrange(0, self.W)
                    y = random.randrange(0, self.H - l + 1)
                    row = [(x,y+dy)
                           for dy in range(0, l)]
                if len([v for v in filter(lambda o: self.get(o[0], o[1])[0] is not None, row)]) == 0:
                    for x, y in row:
                        self.board[x + y*self.W] = True
                    self.pieces.append((x,y,h))
                    break

    def get(self, x, y):
        return (self.board[x + y*self.W], self.hits[x + y*self.W])

    def state(self):
        return [item for it in [
            [
                1 if x is not None and x else 0,
                1 if x is not None and not x else 0
            ]
            for x in self.hits
        ] for item in it]

    def actions(self):
        return [(x,y) if self.get(x,y)[1] is None else None
                for y in range(self.H)
                for x in range(self.W)]

    def get_str(self, x, y):
        piece, hit = self.get(x, y)
        if hit is not None:
            return '#' if hit else '.'
        return 'o' if piece is not None else ' '

    def print(self, other):
        if self.W != other.W or self.H != other.H:
            raise ValueError('dimensions unequal')

        print('/'+''.join(['-' for i in range(0,self.W+self.W-1)])+'\\   /'+
                  ''.join(['-' for i in range(0,other.W+other.W-1)])+'\\')
        for y in range(self.H):
            print("|" + (' '.join([self.get_str(x,y)
                                    for x in range(self.W)])) + "|   |" +
                          (' '.join([other.get_str(x,y)
                                    for x in range(other.W)]))+'|')
        print('\\'+''.join(['-' for i in range(0,self.W+self.W-1)])+'/   \\'+
                  ''.join(['-' for i in range(0,other.W+other.W-1)])+'/')

    def play(self, x, y):
        piece, hit = self.get(x, y)

        if hit is not None:
            return None

        hit = True if piece else False
        self.hits[x + y*self.W] = hit

        if len([v for v in filter(lambda v: v[0] is not None and v[1] is None,
                      [self.get(x,y)
                       for y in range(self.H)
                       for x in range(self.W)])]) == 0:
            return (True, True)
        return (False, hit)

if __name__ == '__main__':

    state = None

    try:
        state = torch.load("model-bship.pt", weights_only = True)
    except:
        pass

    players = [1,2]
    games = [HalfBattleship() for pl in players]
    states = [None for pl in players]
    acts = [None for pl in players]
    next_states = [None for pl in players]

    agent = Learner(len(games[0].actions()), len(games[0].state()), state = state, EPS_DECAY=10000)

    while True:
        for i, pl in enumerate(players):
            print()
            game = games[i]
            states[i] = game.state()
            next_states[i] = None
            state = states[i]

            act = None
            actions = game.actions()
            while act is None:
                act = agent.decide(state)
                if actions[act] is None:
                    print('badact', act)
                    agent.learn(state, act, state, -1)
                    act = None

            acts[i] = act

            term, winner = game.play(actions[act][0], actions[act][1])
            print("state:",(term,winner))
            next_states[i] = game.state()
            print("learn", 1 if winner else -0.1)
            agent.learn(states[i], acts[i], next_states[i], 1 if winner else 0)

            other_reward = 0
            if term and winner:
                print()
                print("@@@@")
                print("@@@@")
                print("@@@@ WINNER :"+str(pl)+" @@@@")
                print("@@@@")
                print("@@@@")
                print()

            coverage = len([v for v in filter(lambda v: v is not None, game.hits)]) / len(game.hits)
            print(str(round(coverage*100))+"% covered")
            games[0].print(games[1])
            torch.save(agent.get_model_state(), "model-bship.pt")

            if term or coverage > 0.6:
                games = [HalfBattleship() for pl in players]
                states = [None for pl in players]
                acts = [None for pl in players]
                next_states = [None for pl in players]
                break

from learner import Learner
from battleship import HalfBattleship
import torch
import random

state = None

try:
    state = torch.load("model-bship.pt", weights_only = True)
except:
    pass

game = HalfBattleship()
agent = Learner(len(game.actions()), len(game.state()), state = state, layers = [100,100])

for x, y, h in game.pieces:
    print(('-' if h else '|')+("ABCDEFGHIJ")[y]+("0123456789")[x])

gaming = True

while gaming:
    act = None
    actions = game.actions()
    act = agent.decide(game.state(), final=True)
    while actions[act] is None:
        act = random.randrange(0, len(actions))
    print(("ABCDEFGHIJ")[actions[act][1]]+("0123456789")[actions[act][0]])

    while True:
        try:
            line = input()
        except:
            gaming = False
            break

        if line == "WIN":
            gaming = False
            break

        if line == "MISS" or line == "HIT":
            game.hits[actions[act][0] + actions[act][1]*game.W] = line == "HIT"
            break

# i dont know the math i stole it from https://docs.pytorch.org/tutorials/intermediate/reinforcement_q_learning.html

import math
import random
from collections import namedtuple, deque
from itertools import count

import torch
import torch.nn as nn
import torch.optim as optim
import torch.nn.functional as F

device = torch.device(
    "cuda" if torch.cuda.is_available() else
    "mps" if torch.backends.mps.is_available() else
    "cpu"
)

Transition = namedtuple('Transition',
                        ('state', 'action', 'next_state', 'reward'))

class ReplayMemory(object):

    def __init__(self, capacity):
        self.memory = deque([], maxlen=capacity)

    def push(self, *args):
        self.memory.append(Transition(*args))

    def sample(self, batch_size):
        return random.sample(self.memory, batch_size)

    def __len__(self):
        return len(self.memory)


class DQN(nn.Module):

    def __init__(self, n_observations, n_actions, layers):
        super(DQN, self).__init__()
        self.layers = [];
        self.layers.append(nn.Linear(n_observations, layers[0]))
        for i, lay in enumerate(layers[:-1]):
            self.layers.append(nn.Linear(lay, layers[i+1]))
        self.layers.append(nn.Linear(layers[len(layers) - 1], n_actions))
        self.layers = nn.Sequential(*[item for it in [[l, nn.ReLU()] for l in self.layers] for item in it][:-1])

    def forward(self, x):
        return self.layers(x)

class Learner:

    def __init__(self,
        n_actions,
        n_observations,
        state = None,
        layers = [128, 128],
        BATCH_SIZE = 128,
        GAMMA = 0.99,
        EPS_START = 0.9,
        EPS_END = 0.05,
        EPS_DECAY = 1000,
        TAU = 0.005,
        LR = 1e-4
    ):
        self.BATCH_SIZE = BATCH_SIZE
        self.GAMMA = GAMMA
        self.EPS_START = EPS_START
        self.EPS_END = EPS_END
        self.EPS_DECAY = EPS_DECAY
        self.TAU = TAU
        self.LR = LR
        self.n_observations = n_observations
        self.n_actions = n_actions
        if state is not None and 'layers' in state:
            layers = state['layers'];
        self.layers = layers
        self.policy_net = DQN(n_observations, n_actions, layers).to(device)
        self.steps_done = 0
        if state is not None:
            self.policy_net.load_state_dict(state['model'])
            self.steps_done = state['steps_done']
        self.target_net = DQN(n_observations, n_actions, layers).to(device)
        self.target_net.load_state_dict(self.policy_net.state_dict())
        self.state = None

        self.optimizer = optim.AdamW(self.policy_net.parameters(), lr=self.LR, amsgrad=True)
        self.memory = ReplayMemory(10000)

    def get_model_state(self):
        return { 'model': self.policy_net.state_dict(), 'steps_done': self.steps_done, 'layers': self.layers }

    def select_action(self, state, final=False):
        sample = random.random()
        if final:
            eps_threshold = 0
        else:
            eps_threshold = self.EPS_END + (self.EPS_START - self.EPS_END) * \
                math.exp(-1. * self.steps_done / self.EPS_DECAY)
            self.steps_done += 1
        if sample > eps_threshold:
            with torch.no_grad():
                return self.policy_net(state).max(1).indices.view(1, 1)
        else:
            return torch.tensor([[random.randrange(0, self.n_actions)]], device=device, dtype=torch.long)

    def optimize_model(self):
        memory = self.memory
        optimizer = self.optimizer
        policy_net = self.policy_net

        if len(memory) < self.BATCH_SIZE:
            return

        transitions = memory.sample(self.BATCH_SIZE)
        batch = Transition(*zip(*transitions))
        non_final_mask = torch.tensor(tuple(map(lambda s: s is not None,
                                              batch.next_state)), device=device, dtype=torch.bool)
        non_final_next_states = torch.cat([s for s in batch.next_state
                                                    if s is not None])
        state_batch = torch.cat(batch.state)
        action_batch = torch.cat(batch.action)
        reward_batch = torch.cat(batch.reward)

        state_action_values = policy_net(state_batch).gather(1, action_batch)

        next_state_values = torch.zeros(self.BATCH_SIZE, device=device)
        with torch.no_grad():
            next_state_values[non_final_mask] = self.target_net(non_final_next_states).max(1).values
        expected_state_action_values = (next_state_values * self.GAMMA) + reward_batch

        criterion = nn.SmoothL1Loss()
        loss = criterion(state_action_values, expected_state_action_values.unsqueeze(1))

        optimizer.zero_grad()
        loss.backward()
        torch.nn.utils.clip_grad_value_(policy_net.parameters(), 100)
        optimizer.step()

    def decide(self, state, final=False):
        state = torch.tensor(state, dtype=torch.float32, device=device).unsqueeze(0)
        action = self.select_action(state, final=False)
        return action

    def learn(self, state, action, observation, reward):
        state = torch.tensor(state, dtype=torch.float32, device=device).unsqueeze(0)

        if not observation:
            next_state = None
        else:
            next_state = torch.tensor(observation, dtype=torch.float32, device=device).unsqueeze(0)

        reward = torch.tensor([reward], device=device)

        self.memory.push(state, action, next_state, reward)

        self.optimize_model()

        target_net_state_dict = self.target_net.state_dict()
        policy_net_state_dict = self.policy_net.state_dict()
        for key in policy_net_state_dict:
            target_net_state_dict[key] = policy_net_state_dict[key]*self.TAU + target_net_state_dict[key]*(1-self.TAU)
        self.target_net.load_state_dict(target_net_state_dict)

from learner import Learner
import torch

# its for initial test

def checkrow(row):
    if len(row) == 0:
        return None
    if row[0] is None:
        return None

    for x in row:
        if x != row[0]:
            return None

    return row[0]

class TicTacToe:
    def __init__(self, W, H, L):
        self.W = W
        self.H = H
        self.L = L
        self.board = [None for i in range(W*H)]

    def get(self, x, y):
        return self.board[x + y*self.W]

    def state(self, pl):
        return [item for it in [
            [
                1 if x == pl else 0,
                1 if x is not None and x != pl else 0
            ]
            for x in self.board
        ] for item in it]

    def actions(self):
        return [(x,y) if self.get(x,y) is None else None
                for y in range(self.H)
                for x in range(self.W)]

    def print(self):
        print("===")
        for y in range(self.H):
            print("  " + (' '.join([str(self.get(x,y))
                                    if self.get(x,y) is not None else '.'
                                    for x in range(self.W)])))
        print("===")

    def play(self, x, y, pl):
        v = self.get(x, y)

        if v is not None:
            return None

        self.board[x + y*self.W] = pl

        # rows
        for x, y in [(x,y)
                     for y in range(self.H)
                     for x in range(self.W - self.L + 1)]:
            row = [self.get(x+d, y)
                   for d in range(self.L)]
            row = checkrow(row)
            if row is not None:
                return (True, row)

        # cols
        for x, y in [(x,y)
                     for y in range(self.H - self.L + 1)
                     for x in range(self.W)]:
            col = [self.get(x, y+d)
                   for d in range(self.L)]
            col = checkrow(col)
            if col is not None:
                return (True, col)

        # diags
        for x, y in [(x,y)
                     for y in range(self.H - self.L + 1)
                     for x in range(self.W - self.L + 1)]:
            dia1 = [self.get(x+dx, y+dy)
                    for dy in range(self.L)
                    for dx in range(self.L)]
            dia2 = [self.get(x+self.L-1-dx, y+dy)
                    for dy in range(self.L)
                    for dx in range(self.L)]
            dia1 = checkrow(dia1)
            dia2 = checkrow(dia2)
            if dia1 is not None:
                return (True, dia1)
            if dia2 is not None:
                return (True, dia2)

        if len([i for i in filter(lambda x: x is not None, self.actions())]) == 0:
            return (True, None)

        return (False, None)


W = 3
H = 3
L = 3

game = TicTacToe(W,H,L)

state = None

try:
    state = torch.load("model-ttt.pt", weights_only = True)
except:
    pass

agent = Learner(len(game.actions()), len(game.state(1)), state = state)

players = [1,2]
states = [None for pl in players]
acts = [None for pl in players]
next_states = [None for pl in players]

while True:
    for i, pl in enumerate(players):
        print()
        states[i] = game.state(pl)
        next_states[i] = None
        state = states[i]

        act = None
        actions = game.actions()
        while act is None:
            act = agent.decide(state)
            if actions[act] is None:
                print('badact', act)
                agent.learn(state, act, None, -0.5)
                act = None

        acts[i] = act

        term, winner = game.play(actions[act][0], actions[act][1], pl)
        print("state:",(term,winner))
        next_states[i] = game.state(pl)

        other_reward = 0
        if term and winner == pl:
            print()
            print("@@@@")
            print("@@@@")
            print("@@@@ WINNER :"+str(pl)+" @@@@")
            print("@@@@")
            print("@@@@")
            print()
            other_reward = -1
            print('learn', 1)
            agent.learn(states[i], acts[i], next_states[i], 1)
        elif term:
            print('learn', 0)
            agent.learn(states[i], acts[i], next_states[i], 0)


        for j, pln in filter(lambda p: p[1] != pl, enumerate(players)):
            if acts[j] is not None:
                print('learn', other_reward)
                agent.learn(states[j], acts[j], next_states[j], other_reward)

        game.print()

        if term:
            states = [None for pl in players]
            acts = [None for pl in players]
            next_states = [None for pl in players]
            game = TicTacToe(W,H,L)
            torch.save(agent.get_model_state(), "model-ttt.pt")
            break

<?php

ob_start(function($buffer) {
	fwrite(STDERR, $buffer);
}, 1);

if (!(
	file_exists(__DIR__.'/vendor/amphp/amp') &&
	file_exists(__DIR__.'/vendor/amphp/byte-stream') &&
	file_exists(__DIR__.'/vendor/amphp/websocket-client')))
{
	$composer_path = 'composer';

	system($composer_path." -qV", $result_code);

	if ($result_code) {
		$composer_path = __DIR__.'/composer';
		copy("https://getcomposer.org/download/latest-stable/composer.phar", $composer_path);
		chmod($composer_path, 0755);
	}

	system('cd '.__DIR__.'; '.$composer_path.' require '.implode(' ', [
		'amphp/websocket-client',
		'amphp/byte-stream',
		'amphp/amp'
	]));
}

require __DIR__.'/vendor/autoload.php';

use function \Amp\async;
use function \Amp\delay;
use function \Amp\Websocket\Client\connect;
use function \Amp\ByteStream\getStdin;
use \Amp\ByteStream\BufferedReader;

echo 'connecting -';

$conn = false;

$spin = 0;

async(function() {
	global $conn, $spin;

	while (!$conn) {
		$spin += 1;
		$spin %= 4;
		echo "\x08".['-','\\',"|",'/'][$spin];
		delay(0.1);
	}
});

$conn = connect('wss://codeguessing.gay/73/ws');
echo "\r            \r";

ob_end_flush();

async(function() {
	global $conn;

	foreach($conn as $msg) {
		$msg = $msg->buffer();
		$msg = json_decode($msg);

		switch($msg->reason) {

		case "connect":
			echo"*** ".$msg->name." joined the game. ***\n";
			break;

		case "disconnect":
			echo "*** ".$msg->name." left the game. ***\n";
			break;

		case "message":
			if (is_string($msg->content)) {
				echo "<".$msg->name."> ".$msg->content."\n";
				break;
			}

		default:
			echo json_encode($msg)."\n";
		}
	}
});

$io = new BufferedReader(getStdin());

while(1) {
	try {
		$x = $io->readUntil("\n");
	} catch (Exception $e) {
		break;
	}
	$conn->sendText(json_encode(["content" => $x]));
}

(q=>(([x,y,z])=>y(`(require)=>{||${x}||}`)(z))(([(q=[
 "𝟠𝜬𝜬𝜬𝄲𝟂𝕪𝕌𝟠𝃘𝂺𜿨𝁂𝃶𝁂𜾎𜻚𜼖𝋖𜻸𜼴𝄲𜾬𝁾𝂺𜼴𜼖𝕪𝕌𝂺𜺼𝄲𜿨𝟠𝃘𝂺𜿨𝁂𝃶𝁂𜾎𜻚𜼖𝋖𜻸𜼴𝄲𜾬𝁾𝂺𜼴𜼖𝟂𝟂𝟠𝢔𝂺𜺼𝄲𜿨𝟠𝇦𝜬𝜬𝜬𝃘𝂺𜿨𝁂𝃶𝁂𜾎𜻚𜼖𝋖𜻸𜼴𝄲𜾬𝁾𝂺𜼴𜼖𝆪𝜬𜼴𝂺𜺼𝂺𜼴𜼖𝂺𝟠𝟂𝜬𝀤𜾎𝁂𜾬𝟠𝟾𝟾𝟂𝟂𝜎𝜎𝟂𝟂𝟂𝟂𝟂𝚴𝂺𝚖𝜬𝜎𝟂𝟂𝟠𜻸𝓲𜻸𜾬𝁂𜾎𝌰𝂺𝃘𜾎𝃶𝜬𜺀𝝊𝙚𝂺𝚖𝜬𝛒𝟠𝟠𜼴𜾎𜾎𜿨𝂜𝜬𝁠𜻸𝄲𝎊𝕌𝕪𜺀𝟠𜽰𝄲𜿊𝜬𝆪𜺀𝜬𝜬𝜬𝇦𝜬𝜬𝜬𝟠𜻸𜾬𝁂𜾎𝌰𝂺𝃘𜾎𝒶𜿊𜾎𜼴𝂜𝜬𝁾𜾬𝁂𜼴𜻸𝋖𝕌𝕪𝟂𜺀𝝨𝅮𝟠𝝨𝁾𝜎𜸈𝇈𝇈𜸈𝇈𝇈𝟂𝞤𝜬𝟠𜸈𝇈𝇈𜸈𝇈𝇈𝜎𝟠𜿨𜿨𝓲𝂺𝃶𝄲𜿨𜽰𝂺𜼴𝜬𜺀𝟠𜿨𝄲𜺼𝂺𝕌𝕪𜺀𝢔𝟂𝟠𝜬𝜬𝜬𝄲𝟂",
 "🜠🁲𞹖𞶢𞻬🀶🜠𞺒🜂💩💋𞵥𞾁𞿛🜟𞾽𞼧𞻍🁒🁰𞼦🇶𞾞",
 "𞾂𞹖🜂𞿺𞻬𞸸𞹴𞶢💪🜟🜟🄥🀗🚧🁓🃩🚧𞼉🚦𞾼🚦𞸶🚦𞽢🜀💨💉🜝🪡𞼇💧🜝𞶟🚥𞶽🚤𞾜",
 "🚨🁲🚨🁔🜂💪💌🜠🪤🁱💩🂭💩💋𞶡📇😯👭🄤🙪🙪🙪🐰𞹲𞹲🁰𞶟🜝🚇𞶟🛿🃧🙩𞼇🁯𞺬🜜🂪💦💈🀔🙨𞸖🜛🛽🛽📿🄡🙧🙧🙧🐭𞹮𞹮🁬𞶜🜚𞶜🛼🃤🙥𞼃🁫𞺩🜙🂧💣💅🀑🙤🀐🜘🛺🛺🚠🪜🁌💡🂥💡💃𞶷💿😧👥🄝🙢🙢🙢🐨𞹪𞹪🁨𞶘🜕🙿𞶵🛷🃟🙡𞻿🁧𞺥🜔🂢💞💀🀌🙠𞼜🜔🛵🛵📷🄙🙟🙟🙟🐥𞹧𞹦🁤𞶔🜒𞶲🛴🃜🙞𞻻🁣𞺡🜑🂟💛👽🀉🙝𞹤🜐🛲🛲🚘🪔𞾐",
 "👮🜠🁲🜠🜂🚨🁔🜠🜂🜁🔃🜟🁓🜟🜁🚧🁱🜟🜀🜀🜀🚦🪢𞾼💨🜞𞹓🚥𞺭🚥𞿙🚥𞾝",
 "🚨𞾾🜂💪💌🜠𞾾💪🀘🙫𞹕🜟🜁🚧𞾽👭🜟𞾽💨𞾼🙪𞹔𞺮𞼦𞾀𞸶🜝🜻🄅𞻩🜻🛿🙩𞼇🁯𞺬🜜𞿶💦💈𞿶🙨𞹒𞺫𞼣𞽽𞸳🜛🜹🜹🛽🛽🚢𞹐💤🄠𞾸🙦𞼢𞿴𞻥𞾷𞸱𞾙",
 "🚨𞾾🄦😰🃪🙬𞼨𞿺𞻬𞾽𞸷𞾟",
 "🃪🚨🪤𞾾🙬𞿜𞻎𞹴🎺🁱🀵𞾟",
 "🜠🜠𞹴🚨𞶢🜂💪💌𞹴🙫𞿛𞻍𞹳🎹🁱🀵𞾟",
 "🜠🜠🀶🚨𞷀🜂💪💌🀶💩💩🜽👏🜽👭𞺯💩🄥𞶠🚦𞶾🃨🔂🀴💨💨🜻🛃🜻👫𞿙💧🄣𞶟🚥𞶼🃦🔀🀲💦💦🜺🛠🜹👩𞾛",
 "💪🄦𞶢🚨𞷀🃪🔄🄦🃪🄥😯🃩🜁🜁🚧🄥𞹕🚧𞺮🚦𞿚🚦𞾞",
 "🃪🜂🔄𞻬𞸚𞼨𞼨🜂🚨🪣𞸷💩🜟🁱🚧🁓🚧🀵🜀💨💊🜞🀴🄤😮🃨📅💧🋇🁯𞸵𞾝",
 "🙬𞼊🁲𞷀🜠🁲🄦😰🃪🚧🁓🄥😯🃩🜁🝛🝛🀵🄤😮🃨💊💨🋈🁰𞸶𞾝",
 "🙬𞼊𞾂𞻬🜠🁲🄦😰🃪🚧🁓🄥😯🃩🜁🪣🝛🝛🀴🄤😐🃨📆💨🋈🁰𞸵𞾝",
 "🙬𞼊🁲𞷀🜠🁲🄦😒🃪🚧🁓🄥😑🃩🜁🝛🝛🀵🄤😐🃨💊💨🋈🁰𞸶𞾝",
 "🙬𞼊𞾂𞻬🜠🁲🄦😒🃪🚧🁓🄥😑🃩🜁🜁🚧🪣𞽢💨🜞🁰🚦🁒🚦🀖🚥𞾝",
 "🜂💪💌🜠🀘👮🜠𞸸🜠🄥🁱🄥😯🃩🚧🁱🄥😑🃨🃨🚦🄤🁒🄤😮🃨🚥🁯🄣😏🃧🃧🚥𞾝",
 "🜂𞵈𞵈𞸸🜠🄦🁔🄦😰🃩🚧🁱🄥😑🃩🃩🚧🄥🁒🄤😮🃨🚦🁒🄤😐🃧🃧🚥𞾝",
 "🜂🜂🪤🔄🜠𞸸🜠🄦🁲🄥😯🃩🚧🁱🄥😑🃩🃩🚦🄤🁰🄤😮🃨🚦🁒🄣😏🃧🃧🚥𞾝",
 "🜂𞵈𞵈𞸸🜠🄦🁲🄦😰🃩🚧🁓🄥😑🃩🃩🚧🄥🁒🄤😮🃨🚦🁒🄤😐🃧🃧🚥𞾝",
 "🜂🜂🜂🚨🪤🁲𞹖𞶢𞻬🀵🜟🜁💩💋𞵥𞿛𞻍𞹳🜞📤📤🜀𞸶𞹲𞶠𞵤🁯𞷛🁯𞽿𞸵🠍🀕🙩𞶽🜜🛾📢𞿘𞻊𞹰🜜📢📡🛽𞵡𞼣𞿵𞸳🠋𞼣💥𞾸🜚🛼📠𞽼𞿖🜚🟬𞼡🛻🁍𞹭𞿳🁫𞼿📟🪝𞼠𞿲𞸰🠈🄞𞹎🚠𞺨🚟𞿓🚟𞾗",
 "🃪💪𞼨📦𞾂𞿜🜠🀘🙬𞺯𞺯🝛🝛🟱𞾟",
 "🜂𞵦𞼨𞿺𞸸🠐𞷀💪𞺰🚧𞶃💩😯🚧𞽣💩𞻫𞿹𞷜🠎🈔𞿸𞸶🜞🜀📤𞷛𞾝",
 "𞾂𞼨𞿺🜠😒🜂𞵦🪤𞼨𞿹𞸷🠏𞷻💩𞺯🄥😯🃩🝸🗲🛢🗲🚈😐🚦🂬📣🄣🂫🚥𞺭🃧💧🜝𞺭🄢😎🃦🛂𞷸📄𞹒🄢😍🃥🝗🝗𞺫🄡😍🃥🛁𞷶💆💤😪🛼👨🄠𞼄🜙😩🚡𞷵🛻🚡🄟𞺩🄟😨🃢🚠𞺨🄞😊🃢🚾𞷳🃡🃡🪛📻🜗🜗𞷳💡𞵺🝰🗪🛚🗪🚀😈🚞𞺥🄛😥🃟🚻𞷱💽𞹋🄛😤🃞🝐🝐𞺤🄚😤🃞🚹𞷯👿💝😣🛵𞴻𞴻🜓𞷮💜🙼𞷮🚚𞵶🚸🚸🛳🚙🄗𞻻🜑𞷭🚙😡🛳🚘🄖𞺠🄖😠🃚🚶𞷬🚘𞺟🄕😁🃙🃙🃙🛱📕🪒𞼖𞿨𞸦🟾𞼴💘🂜💘👹🜍🄓🙙🙙🙙🁁🃗🙘𞻶🁞𞺜🜌𞿦💖👸𞽐🙗𞾋",
 "🁲𞹖🜠𞿺🜂👮𞿺🔄𞽤🙫🁱🀗🀗🜟𞿹🙫𞿛𞾁𞻪🁰𞼦𞼦𞶠🜞🂬💨💉🜝🁑🙩🀕𞿷𞼥𞿷𞸵𞿶🜜𞿶🛾🚤𞽠🙨🀔𞿵𞼣𞿵𞸳𞿵🜛𞿵🛽🛽🛼🙦🀰🁬𞸲🀰𞾚",
 "🜠🂮💪💌𞵦𞴪🜂🜂🜂🚧🀗🙫𞼉𞹕𞾽💩🁓🙫𞹔𞾀𞶂𞿸🜀🪢𞽄🜞🛿📣𞽿𞿙🜝🁑🙩𞹓𞽿𞶀𞿶💈😎😬😬🛾𞷚𞾛",
 "𞾂𞼨𞿺🜠🁔🙬𞹖𞾂𞶄𞿹💋🔡😯🜁𞽅🜟🜁🚧🪢🁰𞷜🁰𞾀𞸶🠎𞺐🜝😏😭😭🛿📣𞼥💧𞾻🜜🛾📢🄢𞹒🚤🂪🚤𞿗🚣𞾛",
 "🃪💪𞼨📦𞾂𞿜🜠𞼨🝜🝛𞼧🄥🗕🃩🜁𞵥🀗🙫𞺮𞺮💨😮📤🁒𞹲𞿸🁯𞽃𞴧🪡𞴧𞴧𞿷𞼥𞹓𞿶🠌𞽾𞿘🜜🟮𞾜",
 "🜂𞵦𞼊🜠𞿜🄦😰🃪🚊𞺯🄥😯🃩🚧𞿛🄥😑🃩🚈𞺮🄤😐🃨🜀𞴨𞿸𞼥𞹓𞿷𞵣🪡𞼥𞿷𞸵🠍🄢𞸖🚤𞶼🚤𞶞🃦💦🄡🄡𞺫🄡😫🃥🚣𞺫🄡😌🃤🃤🚢🋄🁬𞸲𞾚",
 "🙬𞹴🁲𞻬🀘𞻎𞼊🜠🜂💋😯🙫🖙🚧🋉🁱𞸷𞾟",
 "🙬𞹴🁲𞻬🀘𞻎𞼊🜠🜂💋😯🙫🖙🃩📥🪣𞼧𞿹𞸶🠎𞾀💨😮📤𞷜𞾞",
 "𞾂𞼨𞿺🜠😒🜂𞵦🪤𞾂𞿛🜟🟱🜟𞽣🜟𞺯🚧𞸙🚦𞶾🚦𞾞",
 "🜂𞵈𞵈𞽤🜠𞸚🚨𞿜🚨𞶡🚧𞾟",
 "🜂🜂🜂🠐🁔𞹴𞿺🁲𞽆📥🪣𞸙💩🄥🋉🁱𞸷𞾟",
 "🙬𞿜𞼨𞻎𞻎𞹴🜠🋊🁲𞸷𞾟",
 "🙬𞹴🁲𞻬🀘𞻎𞼊🜠🜂🛣𞹕🄥😯🃩🜁🚧🋉🁱𞸶𞾞",
 "🙬𞿜𞼨𞻎𞻎𞹴🜠🋊🁲𞸷𞾟",
 "🙬𞹴🁲𞻬🀘𞻎𞼊🜠🜂🛣𞹕🄥😑🃩🜁🃩📥🪣𞶾💨🋈🁰𞸶𞾞",
 "🙬𞹴🁲𞻬🀘𞻎𞼊🜠🜂💋😯🙫🖙📥𞶡💩🋉🁱𞸶𞾞",
 "🙬𞹴🁲𞻬🀘𞻎𞼊🜠🜂💋😯🙫🖙📥🪣𞾁🛅🛅📤𞾀𞿚🜞𞾀💊😐😮😭😭🛿𞵣𞽿💧😭📣🀳𞻊𞻨𞹒𞻊𞼤𞿶🙨𞿶𞹯𞹯𞻉𞹯🜛🟏🟭🟏🛽📠🁬𞷘🁬𞽼𞸲🠊𞺌🜙😋😩😩🛻𞴣🪝𞴣𞼃🜘𞸒🄞😨🃢🚂𞺨🄞😧🃡🚟𞸑🄝😉🃡🚁𞺧🄜😈🃠🚞𞶶🛸📜🪚𞻿🜕𞿑🄛😥🃟🙿𞸏🄛😤🃞🚜𞿐🄚😆🃞🙾𞸍🄙😅🃝🚛𞶕🛵📙🪗𞴜🁤𞷐🁤𞽴𞸪🠂🜒𞼙💛👽🉡𞹥𞺿𞻻𞽳𞹇𞿪🙜🁢𞼘𞼘🜐🁄🛲🙜𞿋𞽱𞻛🁡𞼗𞼗𞶑🜏🂜💘👺𞼖🙚𞿊𞺼𞹢🎨🁟🀣𞾍",
 "🜠𞿺💪💌🁔🙬🀘𞿺𞼨𞿹𞸷𞿹🜟𞿹🜁🜁🜁🜁🜞🄤🙪🙪🙪🁒🃨🜀📣🪡𞴧🁑𞹱𞿷🁯𞽃𞴧🀲🁮𞸴🀲𞾜",
 "🜠𞿺🜂𞵦🀶𞻎𞻬𞹖𞻎𞼧𞿹🙫𞿹𞹳𞹳𞻍𞹳🜟𞿸🜀📤🁰𞷜🁰𞾀𞸶🠍𞺏🜝😏😭😭😭🛿📣𞴦𞴦🛾🛾🪠🜜🜜🟮𞾹𞼣𞻉🁏🁭𞼣🇳𞾛",
 "𞾂𞹖🙬𞷞𞾂𞻬🀘𞻎𞷞🜁👭🁱𞷝🁱𞾁𞸷🜟🁱𞹔𞶠𞻪🀴🜞𞵤🏴𞼦𞽿𞿷𞻩𞸵𞴧🚥🙋🛡🠍🏲𞻊𞻨𞿘𞽾𞾺🠌🀔🁭𞸳🁭🠋🚅🚅🚅🚅💇🛞🙈𞵠𞻈𞹮𞽼𞾸𞽼𞻥🚡🀯𞻇𞻇𞼿𞽻𞿳🚡𞹎𞺨🁪𞼂𞴢🚠🪜𞹎🚟𞾵🚟🀏🚟🁋🛹💡💃𞵜𞽸𞿒🜖🟨🜖𞻄𞹪𞽷𞾳𞽷𞻡🝑🝑🀫𞻃𞻃𞼺𞽶𞿮🛶🛶🎐𞸎𞻠🀩𞸫𞽵𞻁𞻟🜓🜱𞶳🜱🚚🜰𞸪𞾒",
 "𞹴𞻎𞷞🠐𞻬𞿺𞷞🠐🎺𞹳𞹳𞻍𞹳🜟𞶿🜁🜽🜁🜞🜼🀴𞻌𞻪𞿚𞾀𞾼🙩𞽡𞹓𞻋𞻩🠍🟯💧🠍𞵢🟐𞻊𞹰𞽾𞾺𞽾𞻨🟏📿🠋🋣𞶝𞹯𞽽🀱🋣𞶜🙦🀰𞻈𞼄🚢🠊🟎𞹏𞺩🁫𞼃🟍📽👧👧👧🚠🠈🟌🀮𞻆𞻆𞼾𞽺𞿱🟋📻🠇🟋𞹍𞿱𞹍𞹍𞽸𞻄𞻢💠🜴🛸📜🪚𞹋💟𞻡𞿯𞷓🠅🏫𞼝𞽷𞿮𞻠𞸬🜔𞻂𞹨𞽶𞾲𞽵𞻟🚛𞵙𞺣𞽵𞺣𞿭𞼛𞽴𞻞𞽴𞻞𞾰📶😄😢😡🚙𞾑",
 "𞿺🁲🀘𞿺𞹴𞹖🇸𞾂𞼊𞿹𞻍𞸙𞸷🔃😑😯𞿹🗕🚦🁒𞻌🀖𞶠🇶𞾀𞼈𞿷𞻋𞸗𞸵🔁😏😭𞿷🗓𞴦🛾📢🁐💦𞻨𞿶𞷚🠋🈑𞿵𞸳🜛🛽📡🪟𞹑💤🜚𞹐💤💆🁬𞹐𞶜𞻥🀯🜙🁍𞻇🀑𞶛🚡𞶹🛺💢💄🜘𞺨𞹬𞻆🀮𞿱𞹍𞹍🙣𞹍𞸯🀏𞻅𞸑𞸮🙢🂤𞸮𞶘𞺦𞿰🟨💟🜳𞸭𞸭𞶗🜳🝑🝑𞺥𞹨𞻂🀪𞿮𞹊𞹊🙠𞹊𞸫🀋𞻁𞸍𞸫🙟𞷑𞹧𞽵𞸪𞿬🜒🌖🈈🊀🊞🙞𞹇𞸩𞹥𞽳𞻝𞾯𞽳𞿍𞶓🜐𞵖🀈𞽲𞹤📴🟄𞺾𞸊𞸧🟃🚗🁃𞺽🀇𞶑𞴙🛰🚴🜬🃶𞻚🜬🛰🚖🪒𞶭💗🜍𞶭💗🁟𞷋🁟𞽮𞸤🟼𞹂🙘𞹠𞿦𞹾𞸆𞿥𞹁𞸣🜋🜋𞶫💕👷🜊𞶪🛬🛬🜊𞵐🪎𞺚🁜𞸡𞾉",
 "🔄🟔🙎𞿺𞷀𞸸𞹴🁲🙎𞾽🁱𞼉𞿹🕝😯🟓🚧🁓𞼦𞻌🀴𞽄𞾀𞻪𞾼🔂𞿙🁯𞼥𞹓𞿷🚥𞽿🀕𞿷𞼆𞺬𞻊𞸴𞿶𞻨𞸴🔀𞸳𞹯𞸕𞿵🚣🪟𞾛",
 "𞿺🁲🀘𞿺𞹴𞹖🔄𞵦🀶𞻍𞻍𞽅𞾁𞿹🔃🀵𞻍𞻍𞽄𞾀𞿸🚦🙪🙪🙪🁒𞻋🀕𞶟👫𞵣🜻🀳𞻋𞻩𞸴𞿶𞻨𞸴🚆𞸴𞶞𞺬𞿵🜹📿🜹🁭𞺫𞺫𞼣𞽽🀰🁬𞸲𞽼𞻈𞻦🙈𞽞𞹏𞻇𞻥🜷𞴣🪝📽𞵟𞴣𞴢🚠🁌𞻆🀐𞶚📼🁌𞻅🀏𞶙👥🌛🈍🊅🊣🙣𞹌𞸮𞹪𞽸𞻢𞾴𞽸𞿒𞶗🜕🁉𞻃🀍𞶗🛷📹𞻡𞸎𞼜𞼜🚜🪘𞻾𞿮𞸬𞾓",
 "𞻎🀘🔄🁔𞻎🀘𞶢👮🟔🉯🊍🈕🇷🟓🔃🟓🍽🎹🇶🟒𞴨🜀🜀🜀🚦𞶾💧🁯𞷛🁯𞽿𞸵🜝🁯𞹓𞶞𞻨🀲🜜🛾💦💈🜜𞶻💥🁭𞷙🁭𞽽𞸳🠋𞶻🙦🁎𞻈🀒𞶜🙦𞸲𞿴𞶹𞸱🜙🛻🚡🌝🈏🊇🊥🙤𞺨🁪𞹬𞹎𞿲🜘𞶸🛹🛹🛹🜗𞶷🛹🪛🙣🀭🁨𞸮🀬𞾖",
 "🜠🁲𞹖𞶢𞻬🀶🜠𞿺🜂💩💋𞵥🀵𞻍𞻫𞹕𞻍𞼧𞿸🙪𞿸𞹲𞹲𞻌𞹲🜞𞶽🛿📣𞸵𞾝",
 "𞹴𞻎𞷞🠐𞿺𞴪🜂🚨🜠𞺯𞹳𞻍🀵𞿹𞹕𞹕🙫𞹕𞸶🀖𞻌𞸘𞸶🙪🂬𞸶𞶟𞺭𞿷🟯💧🜻𞸵𞸵𞶟🜺🝘🝘🪠𞺬𞹰𞻊🀲𞿵𞹑𞹑🙧𞹑𞸳🀓𞻉𞸕𞸲🙦𞷘𞹮𞽼𞸲𞿴🜚🌝🈏🊇🊥🙥𞹏𞸱𞹭𞽻𞻤𞾶𞽺𞿔𞶚🜘𞵞🀐𞽹𞹫📻🟋𞽹𞻣🟋🚟🁋𞻄🀎𞶘📺𞶶𞴠🛸🚼🜳🃽𞻡🜳🛷🚝🜕🟧𞾳🛶𞴼𞴼🜔𞾲🙠𞹊👢👡😅🙁😣🛵💻🜓𞶳🙟𞹈👠👠😄🙀😢🛴🛴🪕🝍🝍🜑𞾯💛𞶱🚙🀉🙜🀦𞺾𞻜🙜🀦𞼘𞿪🁢𞹣🜏🛱🚗🀇🙛🀥𞺽𞻚🙚𞼖𞺼𞾬🜎🜎𞶮🙚𞹃🀣𞺻𞹡𞿧🟟💗𞻙𞸆𞼔𞼔🛮🝈🝈𞶬🙘𞾪𞹟𞽭🀃👙🪏🁻🃳𞻗🃲𞸢𞹀🀠𞺸𞹞𞿤📮🟺🞁𞵏𞶩🙕𞸿🀟𞺷𞹝𞿢𞴒🃰𞻔🃰𞻔🞀𞵎𞶨🙓𞾥𞹛𞽩𞿿🙓𞸽𞺗𞼎𞽨𞸞🜆🜤🃮𞻒🜤🛨🙑𞻯🁗𞺕🜅𞿟💏👱🜢🃬𞸜🜢🚪𞿞🛦🙐𞽈𞺱𞽥𞻏🜃🜡🃫𞻏🜡🜂𞴪🂐🔄𞷀🚨🀘🙬𞼊𞹕𞾽𞵇𞵇🟓🟓🜁🜁🜁🜀🜞𞹔🜀📤🀖💨𞵤𞴧📣🪡🀕🙩𞹓💧🂫💧💈𞾺🙨𞾺𞹰𞽾🀔📢🀓🙧𞺫𞺫💥🟭🟭🜛𞹑𞺪🁬𞼄👨👨😪🛼📠🀑🙥🀯𞻇𞻥💣𞻥𞿳𞷗🠈🀮𞻆𞻤𞹎𞻆𞼠𞿲🙣🏭𞻅𞻣𞹍𞻅𞼟𞿱🜗𞺦𞹪𞻄🀬𞿰𞹌𞹌🙢𞹋𞸭🀍𞿯𞹩𞹩🛷📛🀍🙠🀪𞻂𞻠🙠𞼜𞻂𞾲🜓🟇🀩𞻁𞻟𞻟𞿭🀩𞸫𞽴𞻀𞻞🟆🛴📘🪖🄘🀉🙝𞼙🚙🀉🙝𞹥🚙🀉🙜𞸊🚘🀈🙜🀈🃚💚🄖🜭𞼗𞿩𞿋𞸧🜭🚗🜭𞹢𞽰𞾬𞾎",
 "𞸸🜾🚨🜾𞸚𞺰🜾🚨🜾🀗𞻍𞷝𞻫🜽🃩🪣🙫𞼉🁰𞺮🜞🜞🀖🚦𞺮🜀💧💉🂫💧💉𞵣🁑🙩🁯🀔🀔🜜𞺬💦𞹒🜜𞵢🀓𞽽𞹯📿🀓𞴥🛽🙧𞸳𞾚",
 "𞿺𞻬🜠🂮💪💌🁔🙬🀘𞿹𞼧𞿹𞸷𞿹🜟𞺯🜁🜁🜀𞴨🜀📤🀖🙪𞶾💨𞶽💧💉𞹓🜝🛿📣🪡𞷛𞾜",
 "𞾂𞼨𞿺🜠😒🜂𞸸𞹴𞶢𞵥🁱𞷝🁱𞾁𞸷🠏𞹕🜟🜀📤🁒𞹲𞿸🁰𞽄𞴨🀳🁯𞸵🀳𞾝",
 "🜠𞿺🜂𞵦🀶𞻎𞻬𞹖𞻎𞼧𞿹🙫𞿹𞹳𞹳𞻍𞹳🜟𞿸🜀📤🁰𞷜🁰𞾀𞸶🠍𞺏🜝😏😭😭😭🛿𞴧𞹰𞿶𞸴𞸖𞹰𞻨🠌🄢🀓🚣🁏🃥𞴥🛽🜛𞹯𞿵𞺌𞸔𞽼𞹮𞿴🜚🜸𞸔𞻥🀑𞽻🀯𞽻🜷🛻🚡🪝🌜🈎🊆🊤🙤𞺨🁪𞹬𞹍𞿱🜗𞹫𞿱𞺉𞸑𞽹𞹫𞿰🜖🜴𞿒𞹌🜴🛸🙢𞹩𞿯🁧🀍🎑𞽷𞼝𞿯🈋𞶖𞻠🀪🜔🟈🀪𞻂𞻠𞿏𞽵𞾱🙟𞽗𞹉𞻁𞻟🟇🛴🛴🛴📶🙀🙀💺🙼🙻🙻🙻🠁🏧𞺿𞻝𞿍𞽳𞾮🠀𞿌𞽲𞼘𞿪🪔🜐🜐𞹅🚗🀇🚗𞻹🚗🁃🚗𞼴🛰💘👺𞵔🀆💘𞵔𞹄📱🜍𞿧💗👹🂛💗👹𞿦🙘𞽮𞻘𞻘𞿦𞹠🇤𞿦𞶫𞸣🛭🜋𞹁🁻🞡𞹁🀠𞹞𞿤𞿤𞻖🁺🛬🚒🪎𞼑📭𞸿🁹🞟𞼑𞿣𞿅𞸠🁸🚐𞹜📬𞸾🁸🞞𞹜𞽩𞾥𞾇",
 "𞸸🂐🚨𞸚🔄𞹖🂐🞶𞸚𞺯🂏🚧🀗🔃𞹕🂏🞵🀗𞻌𞷜𞻪🂎𞴨📤🪢𞽄💧🄣🃧📣🀕🙩🁑💧𞵣𞴦📢🄢🀔🙨🁐🙨𞼤🚣🀓🙧🁏🙧𞹯🚣🀓🙧🁎🙦𞸔🚢🀒🙦🁎🙦🀑🃣💣🄟🙥🙥🙥🐫𞹭𞹬🁪𞶚🜘🖰🛺🃢🪜🙣𞼁🁩𞺧🜗𞿱💡💃𞻣𞿰𞷔🠆🈌𞿰𞸮🜖🛸🛷📛🀍🙡🁉🙡𞶵💟𞻡𞸎𞼜𞼜📚🁈💞𞻠𞿮𞷑🠃🈉𞿭𞸫🜓🛵📙🀋🙞𞶲💜𞶲💜👾𞿎𞿬𞸩🀧𞾑",
 "🐲𞻬🀘🈴𞿺𞻬🀘𞿺𞹴🜟🜁📥🪣🄥🀗🙫𞼧🚧🀖🙪𞹲🚦🀖🙪𞸘🚦🀕🙩🀕🃧💧🄣🄣🀕🙩𞼤🚤🀔🙨🁐🙨𞹰🚤🀓🙧🁏🙧𞼣🃥🚣🄡🀓🙦𞹮🚢🀒🙦🁎🙦𞼢🚡🀑🙥🁍🙥𞹭🃣🚡🪝🄞🀐🙤𞸒🚠🀐🙤🁌🙣🀏🚟🀏🙣🁋🙣𞸑🃡🚞🄜🀎🙢🀎🚞🀎🙢🁉🙡𞸏🚝🀍🙡🁉🙡🀍🃞🃞🙠𞻾🁦𞺤🜔🜔🄙𞿏🚛𞹉🚛𞾓",
 "🃪🜂💪💌🜠🁲𞹖𞶢𞻬🀵🜟𞺯🜁💩💋𞵥𞾁𞿛🜞🀖🙪🁒🙪𞶾🜀🁰𞷛🁯𞽿𞸵🠍🀕🙩🁑🙩𞶼📢🪠𞽾𞿘🜜𞹒🙨𞹑𞽽𞵿𞿵💇😫🛽𞺫💥🉪𞹮𞻈𞼄𞽼𞹐𞿴🙦🁫𞼡𞼡🜙𞹏🛻🚡🁍🙥🁪🀐🀐🜘🀐🙤🁌🙤𞶷💡𞺧🪛💡𞺧🙣𞸯𞾗",
 "𞿺𞻬🜠𞷼💪💌🜠🁔🙬🀗𞿹𞼧𞿹𞸷𞿹🜟𞺯🜁🚦🀖🙪🁒🙪𞶾💨𞻪𞸗𞼥𞼥🚥𞷹🛿🛿🛿🚥🁮𞷚🁮𞽾𞸴🠌𞺬📢🪟𞽁🙧𞺫𞸕𞹑𞾛",
 "🜠𞺰💪💌𞾠",
 "🙬🁲🀘🀘🜠𞺰💪𞺰🙬𞸷𞾟",
 "𞿺𞻬🜠𞷼💪💌🜠𞾠",
 "🙬🀘𞿺𞼨𞿺𞸸𞿺🜠𞺰🜁🚧𞷻🜁🜁🜁🜁📥𞿛🙪🀴𞼦𞾀🀴𞽄🜞🜀𞴧🛿🛿📣🪡𞿙𞿷𞸵🀳𞾜",
 "🐲𞻬🀘🈴𞿺𞻬🀘𞿺𞹴💩🜟𞿛💩💋𞿛𞸙𞻫🀵𞸶𞾀𞻌𞻪🜞🙪🙪🙪🁯𞹱𞾻𞹓🛿𞵣𞼥𞿷𞸵🠌𞺬💦𞿘🜜🙨🙨🙨🁭𞹯𞾹𞹑🛽📡🪟𞽽𞿗🜚𞽀🙦𞼢𞿴𞻦𞾸𞸲𞾙",
 "💌😰🜂𞽆🙬𞺰𞻎𞺰🜠🜁🜟𞺯🜁📥🁓🙫🁱🀗🀖🜞𞺮💨𞺮🙪𞸶𞾞",
 "𞿺𞻬🜠𞷼💪💌🜠🁔🙬🀗𞿹𞼧𞿹𞸷𞿹🜟𞺯🜁🚦𞷺🜀🜀🜀📤𞹲𞿸𞸵𞸗𞹱𞻩🠍𞺭𞴧🛿🜝𞿘𞿶𞸴🀲𞾜",
 "🐲𞻬🀘🈴𞿺𞻬🀘𞿺𞹴🜁📥🪣𞹳𞿹𞸷𞸙𞹳𞻫🠎🄤🀖🚦🁒🃨𞴨🜀🜝𞶽💧💉🀕𞻋🀳𞸗𞼇𞿶𞻨𞸴🙨𞺎𞸖𞿶𞹰𞶝🈑𞿵𞼣𞿵🀱𞸳𞻉𞹯🜚𞶺🛼🛼🛼📠🪞𞿴𞻥𞸱𞹭𞶛🜙🛻𞴣🛻🜙🜘𞻤🚠𞺨🛺💢💄🜘𞻣𞿱𞷕🠇🉧𞹫𞻅𞼁𞽹𞹌𞿰🜖𞿒💠💂𞹌𞿰𞸭🇭𞽷𞻿𞿯𞻃𞸏𞸭🜕𞿐🚜𞻠🛶🛶🛶🛶🪘"
]).filter((_,i)=>i).join(''),eval(String.fromCodePoint(...[...q[0]].map(x=>(1.22e5-x.codePointAt())/.3e2))),(()=>{try{return require}catch{}})()])))()

; step 1
(import (rename (rnrs(6)) (lambda h)(define s)
                          (begin z)(set! q)))

; step 2
(s entry(let*((g call-with-string-output-port)(j abs)(c expt)(p(h(b)(s i
0)(h()(q i(+ 1 i))(/ b(c 2(- i 1))))))(k log)(d(h(x)(c 2(exact(ceiling(/
(k(let((x(j x)))(if(= x 0)1 x)))(k 2)))))))(m display)(w write))(h(x)(
let((b(p(d x)))(y 0))(g(h(o)(m"x = "o)(do((n(b)(b))(i 0(+ 1 i)))((or(= y
x)(> i 1000)(<(j(let((f(j x)))(-(/ y f)(/ x f))))#e1e-9)))(let*((a(+ y n
))(b(- y n))(u(j(- x a)))(v(j(- x b))))(if(< u v)(z(q y a)(m(if(= i 0)""
" + ")o)(w n o))(z(q y b)(m(if(= i 0)"-"" - ")o)(w n o)))))(if(= y 0)(m
0 o)0)))))))

; step 3
(s(main args)(apply(h(_ x)(display(entry(string->number x)))
(display "\n"))args))(main (command-line))

none:
	# do nothing

CODEGUESS = \
	codeguess-unpacked/1 \
	codeguess-unpacked/2 \
	codeguess-unpacked/3 \
	codeguess-unpacked/4 \
	codeguess-unpacked/5 \
	codeguess-unpacked/6 \
	codeguess-unpacked/7 \
	codeguess-unpacked/8 \
	codeguess-unpacked/9 \
	codeguess-unpacked/10 \
	codeguess-unpacked/11 \
	codeguess-unpacked/12 \
	codeguess-unpacked/13 \
	codeguess-unpacked/14 \
	codeguess-unpacked/15 \
	codeguess-unpacked/16 \
	codeguess-unpacked/17 \
	codeguess-unpacked/18 \
	codeguess-unpacked/19 \
	codeguess-unpacked/20 \
	codeguess-unpacked/21 \
	codeguess-unpacked/22 \
	codeguess-unpacked/23 \
	codeguess-unpacked/24 \
	codeguess-unpacked/25 \
	codeguess-unpacked/26 \
	codeguess-unpacked/27 \
	codeguess-unpacked/28 \
	codeguess-unpacked/29 \
	codeguess-unpacked/30 \
	codeguess-unpacked/31 \
	codeguess-unpacked/32 \
	codeguess-unpacked/33 \
	codeguess-unpacked/34 \
	codeguess-unpacked/35 \
	codeguess-unpacked/36 \
	codeguess-unpacked/37 \
	codeguess-unpacked/38 \
	codeguess-unpacked/39 \
	codeguess-unpacked/40 \
	codeguess-unpacked/41 \
	codeguess-unpacked/42 \
	codeguess-unpacked/43 \
	codeguess-unpacked/44 \
	codeguess-unpacked/45 \
	codeguess-unpacked/46 \
	codeguess-unpacked/47 \
	codeguess-unpacked/48 \
	codeguess-unpacked/49 \
	codeguess-unpacked/50 \
	codeguess-unpacked/51 \
	codeguess-unpacked/52 \
	codeguess-unpacked/53 \
	codeguess-unpacked/54 \
	codeguess-unpacked/55 \
	codeguess-unpacked/56 \
	codeguess-unpacked/57 \
	codeguess-unpacked/58 \
	codeguess-unpacked/59 \
	codeguess-unpacked/60 \
	codeguess-unpacked/61 \
	codeguess-unpacked/62 \
	codeguess-unpacked/63 \
	codeguess-unpacked/64 \
	codeguess-unpacked/65 \
	codeguess-unpacked/66 \
	codeguess-unpacked/67 \

codeguess/%.tar.bz2:
	@mkdir -p codeguess
	@echo fetching $@
	@while ! curl --retry-all-errors --retry 1000000 -sS https://codeguessing.gay/$*.tar.bz2 > codeguess/$*.tar.bz2; do :; done
	@echo fetched $@

codeguess-unpacked/%: codeguess/%.tar.bz2
	@mkdir -p codeguess-unpacked
	cd codeguess-unpacked && tar xf ../codeguess/$*.tar.bz2

codeguess-all: $(CODEGUESS)

models.h: analyzer.scm $(CODEGUESS)
	ratio(){ echo | awk "{ a=$$(cat "$$@"|wc -c); b=$$(cat "$$@"|gzip|wc -c); print a/b }"; }; \
	find $(CODEGUESS) -name '.git' -prune -o -type f -print | while read line; do \
	if [ "$$(du -b "$$line" | grep -oE ^[0-9]\*)" -le 16384 ] && \
	[ $$(echo|awk "{ n=$$(ratio "$$line")>3?1:0; print n; }") = 1 ]; then \
	printf '%s\n' "$$line"; fi; done | \
	( echo 'static const struct model models[] = {'; \
	while read line; do printf '%s\n' "$$(wc -c "$$line")" >&2; \
	guile analyzer.scm < "$$line"; done; echo '};' ) > models.h

decipher: decipher.c models.h
	$(CC) -O3 decipher.c -o decipher

(import (rnrs (6)))
((lambda (fd-in fd-out)
   (define freq (make-vector 256 0))
   (letrec ((loop (lambda ()
                    (define char (get-u8 fd-in))
                    (if (not (eof-object? char))
                      (begin
                        (vector-set!
                          freq
                          char
                          (+ 1 (vector-ref freq char)))
                        (loop))))))
     (loop))
   (letrec ((loop (lambda (i)
                    (if (< i (vector-length freq))
                      (begin
                        (vector-set! freq i (cons i (vector-ref freq i)))
                        (loop (+ i 1)))))))
     (loop 0))
   (vector-sort!
     (lambda (sa ba) (> (cdr sa) (cdr ba)))
     freq)
   (define total
     (letrec ((loop (lambda (i c)
                      (if (< i (vector-length freq))
                        (loop (+ i 1) (+ c (cdr (vector-ref freq i))))
                        c))))
       (loop 0 0)))
   (if (> total 0)
     (letrec ((loop (lambda (i)
                      (if (< i (vector-length freq))
                        ((lambda ()
                           (define elem (vector-ref freq i))
                           (vector-set!
                             freq
                             i
                             (cons (car elem)
                                   (exact->inexact (/ (cdr elem) total))))
                           (loop (+ i 1))))))))
       (loop 0)))
   (put-string
     fd-out
     "\t(struct model) {\n\t\t.items = {\n")
   (letrec ((loop (lambda (i)
                    (if (< i (vector-length freq))
                      ((lambda ()
                         (define char (car (vector-ref freq i)))
                         (define ratio (cdr (vector-ref freq i)))
                         (put-string
                           fd-out
                           (string-append
                             "\t\t\t(struct char_freq) { .who = "
                             (if (and (<= 32 char) (> 127 char))
                               (let ((char (integer->char char)))
                                 (string-append
                                   "'"
                                   (if (or (eq? #\' char) (eq? #\\ char))
                                     "\\"
                                     "")
                                   (make-string 1 char)
                                   "'"))
                               (number->string char))
                             ", .when = "
                             (number->string ratio)
                             " },\n"))
                         (loop (+ i 1))))))))
     (loop 0))
   (put-string fd-out "\t\t}\n\t},\n"))
 (standard-input-port)
 (current-output-port))

#include <stdlib.h>
#include <stddef.h>
#include <stdio.h>

struct char_freq {
	char who;
	double when;
};

struct model {
	struct char_freq items[256];
};

#include "models.h"

#define lenof(obj) (sizeof(obj) / sizeof(*(obj)))

void halt_and_catch() {
	fprintf(stderr, "critical error occurred. please leave the building immediately\n");
	exit(1);
}

char *readfile(FILE *file, size_t *size) {
	int cap = 16;
	char *buf = malloc(cap);
	if (!buf) return NULL;
	int count = 0, c;
	while ((c=fgetc(file))!=EOF) {
		count++;
		if (count > cap) {
			char *buf_ = buf;
			if (!(buf = realloc(buf, (cap *= 2)))) {
				free(buf_);
				return NULL;
			}
		}
		buf[count-1] = c;
	}
	char *buf_ = buf;
	if (!(buf = realloc(buf, count))) {
		free(buf_);
		return NULL;
	}
	*size = count;
	return buf;
}

int sort_model_cb(const void *a_, const void *b_) {
	const struct char_freq *a = a_;
	const struct char_freq *b = b_;
	double diff = b->when - a->when;
	return diff < 0 ? -1 : (diff > 0 ? 1 : 0);
}

void sort_model(struct model *model) {
	qsort(model->items, 256, sizeof(*model->items), sort_model_cb);
}

double cmp_model(struct model *a, struct model *b) {
	double accum = 0;
	for (int i = 0; i < 256; i++) {
		double diff = (a->items[i].when - b->items[i].when);
		accum += diff * diff;
	}
	return accum;
}

void merge_model(const struct model *a, double a_weight, const struct model *b, struct model *out) {
	if (a_weight == 0) {
		*out = *b;
		return;
	}
	struct model b_raw;
	for (int i = 0; i < 256; i++) {
		b_raw.items[(unsigned char)b->items[i].who] = b->items[i];
	}
	for (int i = 0; i < 256; i++) {
		out->items[i] = (struct char_freq) {
			.who = a->items[i].who, .when =
				(a->items[i].when
				 + b_raw.items[(unsigned char)a->items[i].who].when)
				 / (a_weight+1)
		};
	}
	sort_model(out);
}

int analyze_buffer(const char *str, size_t size) {
	size_t freqs[256] = {0};
	for (int i = 0; i < size; i++) {
		freqs[(unsigned char)str[i]]++;
	}
	struct model model;
	for (int i = 0; i < 256; i++) {
		model.items[i] = (struct char_freq) {
			.who = i, .when = ((double)freqs[i])/size,
		};
	}
	sort_model(&model);
	double bestest_score = 1.0/0.0;
	struct model bestest_model;
	for (int d = 0 ;; d++) {
		double best_model_score = 1.0/0.0;
		struct model best_model;
		struct model new_model;
		for (int i = 0; i < lenof(models); i++) {
			merge_model(&bestest_model, d, &models[i], &new_model);
			double score = cmp_model(&model, &new_model);
			if (score < best_model_score) {
				best_model_score = score;
				best_model = new_model;
			}
		}
		if (best_model_score >= bestest_score) {
			break;
		}
		bestest_score = best_model_score;
		bestest_model = best_model;
	}
	char map[256];
	for (int i = 0; i < 256; i++) {
		map[(unsigned char)model.items[i].who] = bestest_model.items[i].who;
	}
	for (int i = 0; i < size; i++) {
		fputc(map[(unsigned char)str[i]], stdout);
	}
	return 0;
}

int analyze_file(FILE *file) {
	size_t size;
	char *data = readfile(file, &size);
	if (!(data && !analyze_buffer(data, size))) {
		return 1;
	}
	return 0;
}

int main(int argc, char **argv) {
	FILE *file = stdin;
	if(argc > 1) {
		file = fopen(argv[1], "rb");
		if (!file) {
			halt_and_catch();
		}
	}
	if (analyze_file(file)) {
		halt_and_catch();
	}
	return 0;
}

#include <errno.h>
#include <fcntl.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <sys/time.h>
#include <sys/wait.h>
#include <time.h>
#include <unistd.h>

#define THE_SIZE 0x20000000000
// also known as 2 TiB

void sin(const char *err)
{
	fprintf(stderr, "fatal: sinful system%s%s\n", err ? ": " : "",
	        err ? err : "");
	exit(1);
}

typedef struct {
	uint8_t a : 4, b : 4;
} bitbyte_t;

typedef struct {
	uint64_t total;
	uint64_t off_8;
	uint64_t off_16;
	uint64_t off_32;
	uint64_t off_64;
	uint64_t data;
} data_t;

static data_t *data;

void *align(void *ptr, int ligma)
{
	return (void *)(((size_t)ptr + (ligma - 1)) & -ligma);
}

uint64_t get(uint64_t i)
{
	if (i >= data->total) {
		sin("sinful memory access");
	}

	char *ptr = (char *)&data->data;
	uint64_t off = 0;

	if ((data->off_8 - 1) <= i) {
		ptr += (data->off_8 - 1 - off) / 2 +
		       (data->off_8 - 1 - off) % 2;
		ptr = align(ptr, 1);
		off += data->off_8 - 1;
	} else {
		bitbyte_t *v = &((bitbyte_t *)ptr)[(i - off) / 2];
		return (i - off) % 2 ? v->b + 1 : v->a + 1;
	}

	if ((data->off_16 - 1) <= i) {
		ptr += 1 * (data->off_16 - 1 - off);
		ptr = align(ptr, 2);
		off += data->off_16 - 1;
	} else {
		return ((uint8_t *)ptr)[i - off] + 1;
	}

	if ((data->off_32 - 1) <= i) {
		ptr += 2 * (data->off_32 - 1 - off);
		ptr = align(ptr, 4);
		off += data->off_32 - 1;
	} else {
		return ((uint16_t *)ptr)[i - off] + 1;
	}

	if ((data->off_64 - 1) <= i) {
		ptr += 4 * (data->off_64 - 1 - off);
		ptr = align(ptr, 8);
		off += data->off_64 - 1;
	} else {
		return ((uint32_t *)ptr)[i - off] + 1;
	}

	return ((uint64_t *)ptr)[i - off] + 1;
}

void append(uint64_t val)
{
	uint64_t i = data->total++;

	if (val < 1) {
		sin("sinful data");
	}
	val--;

	if (val >= (1ULL << 4) && !data->off_8) {
		data->off_8 = i + 1;
	}

	if (val >= (1ULL << 8) && !data->off_16) {
		data->off_16 = i + 1;
	}

	if (val >= (1ULL << 16) && !data->off_32) {
		data->off_32 = i + 1;
	}

	if (val >= (1ULL << 32) && !data->off_64) {
		data->off_64 = i + 1;
	}

	char *ptr = (char *)&data->data;
	uint64_t off = 0;

	if ((data->off_8 - 1) <= i) {
		ptr += (data->off_8 - 1 - off) / 2 +
		       (data->off_8 - 1 - off) % 2;
		ptr = align(ptr, 1);
		off += data->off_8 - 1;
	} else {
		bitbyte_t *v = &((bitbyte_t *)ptr)[(i - off) / 2];
		(i - off) % 2 ? (v->b = val) : (v->a = val);
		return;
	}

	if ((data->off_16 - 1) <= i) {
		ptr += 1 * (data->off_16 - 1 - off);
		ptr = align(ptr, 2);
		off += data->off_16 - 1;
	} else {
		((uint8_t *)ptr)[i - off] = val;
		return;
	}

	if ((data->off_32 - 1) <= i) {
		ptr += 2 * (data->off_32 - 1 - off);
		ptr = align(ptr, 4);
		off += data->off_32 - 1;
	} else {
		((uint16_t *)ptr)[i - off] = val;
		return;
	}

	if ((data->off_64 - 1) <= i) {
		ptr += 4 * (data->off_64 - 1 - off);
		ptr = align(ptr, 8);
		off += data->off_64 - 1;
	} else {
		((uint32_t *)ptr)[i - off] = val;
		return;
	}

	((uint64_t *)ptr)[i - off] = val;
}

int generator(const char *path)
{
	int fd = open(path, O_RDWR | O_CREAT, 0644);
	if (fd == -1)
		sin(strerror(errno));
	if (truncate(path, THE_SIZE))
		sin(strerror(errno));

	data = mmap(NULL, THE_SIZE, PROT_READ | PROT_WRITE, MAP_SHARED,
	            fd, 0);

	if (data == MAP_FAILED)
		sin(strerror(errno));

	int column = 0;

	int human_readable = isatty(fileno(stdout));

	for (uint64_t i = 0; i < data->total; i++) {

		column += printf("%llu", (unsigned long long)get(i));

		if (!human_readable) {
			column = 100;
		}

		if (column > 72) {
			printf("\n");
			column = 0;
		} else {
			column += printf(" ");
		}
	}

	struct timespec ts_begin;
	clock_gettime(CLOCK_MONOTONIC, &ts_begin);

	for (;;) {

		uint64_t max_rep = 1;

		for (uint64_t stride = 1;
		     stride <= data->total / (max_rep + 1); stride++) {

			uint64_t rep;

			for (rep = 1; (rep + 1) <= data->total / stride;
			     rep++) {
				for (uint64_t i = 0; i < stride; i++) {
					if (get(data->total - 1 - i -
					        rep * stride) !=
					    get(data->total - 1 - i -
					        (rep - 1) * stride)) {
						goto repeat_out;
					}
				}
			}

		repeat_out:

			if (max_rep < rep) {
				max_rep = rep;
			}
		}

		column += printf("%llu", (unsigned long long)max_rep);

		if (!human_readable) {
			column = 100;
		}

		if (column > 72) {
			printf("\n");
			column = 0;
		} else {
			column += printf(" ");
		}

		struct timespec ts_end;
		clock_gettime(CLOCK_MONOTONIC, &ts_end);

		if ((ts_end.tv_sec * 1000 + ts_end.tv_nsec / 1000000) -
		        (ts_begin.tv_sec * 1000 +
		         ts_end.tv_nsec / 1000000) >
		    50) {
			fflush(stdout);
			clock_gettime(CLOCK_MONOTONIC, &ts_begin);
		}

		append(max_rep);
	}

	return 0;
}

int main()
{
	const char *cfg_home = getenv("XDG_CONFIG_HOME");

	if (!cfg_home) {

		const char *home = getenv("HOME");
		if (!home) {
			return generator("/tmp/cg666.bin");
		}

		char path[strlen(home) +
		          sizeof("/.config/cg666/data.bin")];
		path[0] = '\0';

		strcat(path, home);
		strcat(path, "/.config/cg666");

		pid_t pid;
		if (!fork()) {
			if (execl("/usr/bin/env", "/usr/bin/env",
			          "mkdir", "-p", "--", path, NULL))
				sin(strerror(errno));
			return 0;
		}
		int status;
		if (waitpid(pid, &status, 0) == -1) {
			sin(strerror(errno));
		} else if (status != 0) {
			sin("mkdir is a sinner");
		}

		strcat(path, "/data.bin");
		return generator(path);

	} else {

		char path[strlen(cfg_home) + sizeof("/cg666/data.bin")];
		path[0] = '\0';

		strcat(path, cfg_home);
		strcat(path, "/cg666");

		pid_t pid;
		if (!fork()) {
			if (execl("/usr/bin/env", "/usr/bin/env",
			          "mkdir", "-p", "--", path, NULL))
				sin(strerror(errno));
			return 0;
		}
		int status;
		if (waitpid(pid, &status, 0) == -1) {
			sin(strerror(errno));
		} else if (status != 0) {
			sin("mkdir is a sinner");
		}

		strcat(path, "/data.bin");
		return generator(path);
	}
}

--
-- // Code by SoundOfSpouting#6980 (UID: 151149148639330304)
--
-- visual text editor inspired by Emacs evil mode
--

term = require "term"
text = require "text"
event = require "event"
unicode = require "unicode"
keyboard = require "keyboard"
serialization = require "serialization"

local args = {...}

editor = {}

editor.commands = {}
editor.buffer = {}

function dump(v)
	return serialization.serialize(v, math.huge)
end

function dumpfile(f,v)
	local f = io.open(f,"w")
	f:write(type(v) == "string" and v or dump(v))
	f:close()
end

local function main()
	local state = {
		args = args,
		arg_n = 1,
		arg_type = nil,
		short_arg_n = nil,
		args_done = false,
	}

	editor.set_mode("normal")
	editor.buffer = editor.new_buffer()

	while state.arg_n <= #state.args do
		local arg = state.args[state.arg_n]

		if not state.arg_type then
			if arg == "--" then

				state.args_done = true

			elseif not state.args_done and arg:match("^%-%-") then

				state.arg_type = "long"
				state.arg = state.args[state.arg_n]:sub(3, -1)

			elseif not state.args_done and arg:match("^%-") then

				state.arg_type = "short"
				state.short_arg_n = 2
				state.arg = state.args[state.arg_n]:sub(
					state.short_arg_n,
					state.short_arg_n
				)

			else

				editor.commands.open(arg)

			end
		end

		if state.arg_type then
			local func = editor[state.arg_type .. "opts"][state.arg]
			local ok, err = true

			if not func then
				ok, err = nil,
					"unknown option: "

						.. ({
							long = '--',
							short = '-'
						})[state.arg_type]

						.. state.arg
			end

			if ok then
				ok, err = func()
			end

			if not ok then
				io.stderr:write(err,'\n')
				return
			end

			if state.exit then
				return
			end
		end

		state.arg_n = state.arg_n + 1
	end

	editor.run()

	return true
end

	TheWeakster	=	{
		__mode	=	"k"
	}

function class(obj, super)
	obj.__index = function(self, i)
		local v
		if self ~= obj then
			v = obj[i]
		end
		if super and v == nil then
			return super[i]
		end
		if self == obj then return nil end
		return v
	end
	obj.__proto__ = obj
	setmetatable(obj, obj)

	return obj
end

function static(fn)
	return function(self, ...)
		if self.__proto__ ~= self then
			return fn(self.__proto__, ...)
		end
		return fn(self, ...)
	end
end

function unrecursive(fn)
	local n = 0
	local function pack(...)
		return {n = select('#', ...), ...}
	end
	return function(...)
		assert(n < 1, "recursion forbidden here")
		n = n + 1
		local ret = pack(fn(...))
		n = n - 1
		return (unpack or table.unpack)(ret, 1, ret.n)
	end
end

local function DumpLengths(obj)
	local prim = obj:Length()
	for k,v in pairs(obj:Lengths()) do
		if k ~= "chars" then
			prim = ("%s, %s=%s"):format(prim, k, type(v)=="table" and v.chars or v)
		end
	end
	return prim
end

Rope = class {}

Rope.__Fibo = {[0] = 1}

for n=1,64 do
	Rope.__Fibo[n] =
	  (Rope.__Fibo[n - 1] or 0)
	+ (Rope.__Fibo[n - 2] or 0)
end

function Rope:__call(String, LeafSize)
	local obj = class ({}, self)

	obj.String = String
	obj.__LeafSize = __LeafSize or 200
	obj.__empty = obj:New()

	return obj
end

function Rope:__New(data, left, right, norebal)
	local obj = setmetatable({}, self)

	if data then
		obj.__height = 1
		obj.__data = data
		obj.__count = 1
		obj.__Lengths = data:Lengths()
		assert(not (left or right), "branching leaf")
		return obj
	end

	if left and not right then return left end
	if right and not left then return right end

	assert(left or right, "Bad")

	obj.__height = math.max(left.__height, right.__height) + 1
	obj.__count = left.__count + right.__count
	obj.__left = left
	obj.__right = right

	local add = function(a,b) return a+b end

	obj.__Lengths = self:LengthAdd(left:Lengths(), right:Lengths())

	if not norebal then
		if obj:__BalanceFactor() < -1 then

			if left:__BalanceFactor() > 0 then
				left = left:__rotateLeft()
			end

			obj = obj:__rotateRight()
			left, right = obj.__left, obj.__right

		elseif obj:__BalanceFactor() > 1 then

			if right:__BalanceFactor() < 0 then
				right = right:__rotateRight()
				obj = self:__New(nil, left, right, true)
			end

			obj = obj:__rotateLeft()
			left, right = obj.__left, obj.__right

		end
	end

	return obj
end
Rope.__New = static(Rope.__New)

function Rope:__BalanceFactor()
	if self.__height == 1 then return 0 end
	return self.__right.__height - self.__left.__height
end

function Rope:New(...)
	assert(self.String, "usage: Rope(String[, LeafSize]):New()")

	local obj

	for n = 1, select('#', ...) do
		local v = select(n, ...)
		local i = 1
		local l = v:Length()
		local objs = {}
		if obj then
			objs[#objs + 1] = obj
		end
		if l <= self.__LeafSize then
			objs[#objs + 1] = self:__New(v)
		else
			while i <= l do
				local s = v:Slice(i, i + self.__LeafSize - 1)
				i = i + s:Length()
				objs[#objs + 1] = self:__New(s)
			end
		end
		obj = self:Join(objs)
	end

	return obj
end

function Rope:__rotateLeft()
	if self.__height < 3 or self.__right.__height < 2 then
		return self
	end

	local a, b, c =
		self.__left,
		self.__right.__left,
		self.__right.__right

	return self:__New(nil, self:__New(nil, a, b, true), c, true)
end

function Rope:__rotateRight()
	if self.__height < 3 or self.__left.__height < 2 then
		return self
	end

	local a, b, c =
		self.__left.__left,
		self.__left.__right,
		self.__right

	return self:__New(nil, a, self:__New(nil, b, c, true), true)
end

function Rope:Dump(i1)
	i1 = i1 or ""
	local i2 = i1 .. "  "
	if self.__data then
		return self.__data:Dump(i1)
	end
	return (("%sRope(%s, height=%s(%s)) {\n%s\n%s\n%s}"):format(
		i1,
		DumpLengths(self),
		self.__height,
		self:__BalanceFactor(),
		self.__left:Dump(i2),
		self.__right:Dump(i2),
		i1
	))
end

function Rope:Length(Cat)
	return self.String.Length(self, Cat)
end

function Rope:Lengths()
	return self.__Lengths
end

function Rope:LengthAdd(this, other)
	return self.String:LengthAdd(this, other)
end

function Rope:DefaultLengthAdd(this, other)
	return self.String:DefaultLengthAdd(this, other)
end

function Rope:SliceTest(Cat, a, i,j, w)
	return self.String:SliceTest(Cat, a, i,j, w)
end

function Rope:Leaves(rev)
	if self.__data then
		local b = true
		return function()
			if not b then
				return
			end
			b = false
			return self.__data
		end
	end

	local function lazy(f)
		local v = nil
		local b = false
		return function()
			if not b then
				v = f()
				b = true
			end
			return v
		end
	end

	local a, b =
		lazy(function() return self.__left:Leaves(rev) end),
		lazy(function() return self.__right:Leaves(rev) end)

	if rev then
		a, b = b, a
	end

	local function iter()
		if not a then return end
		local v = a()()
		if v == nil then
			a, b = b
			return iter()
		end
		return v
	end
	return iter
end

function Rope:Implode()
	if self.__data then
		return self.__data
	end

	local leaves = {}

	for leaf in self:Leaves() do
		leaves[#leaves + 1] = leaf
	end

	return self.String:Join(leaves)
end

function Rope:__Join(other, rev)
	if other.__height > self.__height then
		return other:__Join(self, not rev)
	end
	if self.__data and other.__data then
		if self:DefaultLengthAdd(self:Lengths(), other:Lengths()) <= self.__LeafSize then
			if rev then
				return self:__New(self.String:Join { other.__data, self.__data })
			else
				return self:__New(self.String:Join { self.__data, other.__data })
			end
		else
			if rev then
				return self:__New(nil, other, self)
			else
				return self:__New(nil, self, other)
			end
		end
	end
	if  self.__height - other.__height > 1 or
	    (self.__height == 2
	and other.__height == 1
	and self:DefaultLengthAdd(self[rev and "__left" or "__right"]:Lengths(), other:Lengths()) <= self.__LeafSize)
	then
		if rev then
			return self:__New(nil, self.__left:__Join(other, rev), self.__right)
		else
			return self:__New(nil, self.__left, self.__right:__Join(other, rev))
		end
	end
	if rev then
		return self:__New(nil, other, self)
	else
		return self:__New(nil, self, other)
	end
end

function Rope:Join(Ropes)
	local obj = self:PreJoin(Ropes, function(str)
		local neut = false
		return function()
			if neut then return end
			neut = true
			return str
		end
	end, function(...)
		return self:New(...)
	end)
	if obj then
		return obj
	end

	for _, v in ipairs(Ropes) do
		assert(v)
		obj = obj and obj:__Join(v) or v
	end

	return obj
end

function Rope:SliceBy(Cat, i, j)
	if i > j then
		return self:Empty(self)
	end
	if self.__data then
		local origin = self.__data
		local sliced

		if Cat == nil then
			sliced = origin:Slice(i, j)
		else
			sliced = origin:SliceBy(Cat, i, j)
		end

		if origin == sliced then
			return self
		end
		
		return self.__proto__:__New(sliced)
	end

	local test = function(a, i,j, w)
		local b, ii, jj = self:SliceTest(Cat, a, i,j, w)
		if b ~= nil then return b, ii, jj end
		if not w then
			return i<=a, i, j
		else
			return i>a or j>a, i-a, j-a
		end
	end

	local t = {}

	local f,  ni,  nj  = test(self.__left:Length(Cat), i, j, false)
	local f2, ni2, nj2 = test(self.__left:Length(Cat), i, j, true)

	if f2 and i == -math.huge then
		t[#t + 1] = self.__left
	elseif f then
		t[#t + 1] = self.__left:SliceBy(Cat, ni, f2 and math.huge or nj)
	end
	if f and j == math.huge then
		t[#t + 1] = self.__right
	elseif f2 then
		t[#t + 1] = self.__right:SliceBy(Cat, f and -math.huge or ni2, nj2)
	end

	return self:Join(t)
end

function Rope:PreJoin(strs, bomb, factory)
	return self.String.PreJoin(self, strs, function(obj)
		return coroutine.wrap(function()
			for obj in bomb(obj) do
				for obj in obj:Leaves() do
					coroutine.yield(obj)
				end
			end
		end)
	end, function(...)
		return factory(self.String:New(...))
	end)
end

function Rope:Empty(base)
	return self:New(self.String:Empty(base))
end

function Rope:Slice(i, j)
	return self:SliceBy(nil, i, j)
end

EditorString = class {}

function EditorString:__CharLProc(char, to)
	if char == "\t" or char == "\n" then
		to.tabcells_first = self:Empty(self):Lengths()
		to.tabcells_last = self:Empty(self):Lengths()
		to.tabcells = 2
	else
		to.tabcells_first = to
		to.tabcells_last = to
		to.tabcells = 1
	end
	if char == "\n" then
		to.lines_first = self:Empty(self):Lengths()
		to.lines_last = self:Empty(self):Lengths()
		to.lines = 2
	else
		to.lines_first = to
		to.lines_last = to
		to.lines = 1
	end
	to.lines_longest_visual = to.lines_first
end

function EditorString:__NewLength()
	local t = {
		chars = 0,
		visual = 0,
		vis_broken_left = 0,
		vis_broken_right = 0,
		tabcells = 1,
		lines = 1,
		tabstop = nil,
		offset = 0,
	}
	t.lines_first = t
	t.lines_last = t
	t.lines_longest_visual = t
	t.tabcells_first = t
	t.tabcells_last = t
	return t
end

function EditorString:LengthAdd(this, other)
	assert(
			this.vis_broken_right == 0
		and other.vis_broken_left == 0,
		"cannot join")
	local to = {}
	assert(this.tabcells_first.tabcells == 1)
	assert(this.tabcells_last.tabcells == 1)
	assert(this.lines_first.lines == 1)
	assert(this.lines_last.lines == 1)
	to.chars = this.chars + other.chars
	to.visual = this.visual + other.visual
	to.vis_broken_left = this.vis_broken_left
	to.vis_broken_right = other.vis_broken_right
	to.tabcells = this.tabcells + other.tabcells - 1
	to.lines = this.lines + other.lines - 1
	to.tabstop = this.tabstop
	to.offset = this.offset
	if this.lines == 1 and other.lines > 1 then
		to.lines_first = self:LengthAdd(
			this,
			other.lines_first
		)
	elseif this.lines == 1 then
		to.lines_first = to
	else
		to.lines_first = this.lines_first
	end
	if other.lines == 1 and this.lines > 1 then
		to.lines_last = self:LengthAdd(
			this.lines_last,
			other
		)
	elseif other.lines == 1 then
		to.lines_last = to
	else
		to.lines_last = other.lines_last
	end
	if to.lines > 1 then
		local longest = this.lines_longest_visual
		if this.lines > 1 and other.lines > 1 then
			local middle = self:LengthAdd(this.lines_last, other.lines_first)
			longest = longest.visual < middle.visual and middle or longest
		end
		local last = to.lines_last
		longest = longest.visual < last.visual and last or longest
		local long2 = other.lines_longest_visual
		longest = longest.visual < long2.visual and long2 or longest
		to.lines_longest_visual = longest
	else
		to.lines_longest_visual = to
	end
	if this.tabcells == 1 and other.tabcells > 1 then
		to.tabcells_first = self:LengthAdd(
			this,
			other.tabcells_first
		)
	elseif this.tabcells == 1 then
		to.tabcells_first = to
	else
		to.tabcells_first = this.tabcells_first
	end
	if other.tabcells == 1 and this.tabcells > 1 then
		to.tabcells_last = self:LengthAdd(
			this.tabcells_last,
			other
		)
	elseif other.tabcells == 1 then
		to.tabcells_last = to
	else
		to.tabcells_last = other.tabcells_last
	end
	to.tabwidth = this.tabwidth or other.tabwidth or nil
	if to.tabcells_first.chars == to.lines_first.chars then
		to.tabwidth = nil
	end
	return to
end

function EditorString:DefaultLengthAdd(this, other)
	return this.chars + other.chars
end

function EditorString:New(str, tabstop, offset)
	local obj = setmetatable({}, self.__proto__)

	offset = offset or 0

	local i = 1
	local t = {}

	local charlen = self:__NewLength()
	charlen.chars = 1

	obj.__Lengths = self:__NewLength()
	obj.__Lengths.tabstop = tabstop
	obj.__Lengths.offset = offset % tabstop

	while i <= #str do
		local char = unicode.sub(str:sub(i, i+3), 1, 1)
		i = i + #char
		local charW
		obj:__CharLProc(char, charlen)
		if char == "\t" then
			charW = tabstop - offset % tabstop
			char = "\t" .. string.char(charW)
			charlen.tabwidth = charW
		else
			charW = unicode.charWidth(char)
			charlen.tabwidth = nil
		end
		if char == "\n" then
			offset = -charW
		end
		charlen.visual = charW
		offset = ((offset + charW) % tabstop)
		obj.__Lengths = self:LengthAdd(
			obj.__Lengths,
			charlen,
			obj.__Lengths
		)
		t[#t + 1] = char
	end

	obj.__data = table.concat(t)

	return obj
end

function EditorString:SliceBy(Cat, i, j)
	if i > j then
		return self:Empty(self)
	end
	if (Cat == nil or Cat == "chars") and i <= 1 and j >= self.__Lengths.chars then
		return self
	end

	local obj = setmetatable({}, self.__proto__)

	obj.__Lengths = self:__NewLength()
	obj.__Lengths.tabstop = self.__Lengths.tabstop
	obj.__Lengths.offset = self.__Lengths.offset

	local charlen = self:__NewLength()
	charlen.chars = 1

	local _ic = 1

	local _i = 1
	if Cat == "visual" then
		_i = _i - self.__Lengths.vis_broken_left
		j = math.min(self.__Lengths.visual, j)
		i = math.max(1, i)
	end

	local t = {}
	local left, right = 0, 0

	while _ic <= #self.__data and _i <= j do
		local char = unicode.sub(self.__data:sub(_ic, _ic+3), 1, 1)
		local tab
		_ic = _ic + #char

		if char == "\t" then
			tab = self.__data:sub(_ic, _ic)
			_ic = _ic + 1
		end
		local charW
		if tab then
			charW = tab:byte()
		else
			charW = unicode.charWidth(char)
		end

		local ins

		if Cat == nil or Cat == "chars" then
			ins = _i >= i
			if _i > j then
				break
			end
			_i = _i + 1
		elseif Cat == "visual" then
			local _j = _i + charW - 1
			if _i < i and _j >= i then
				left = i - _i
				ins = true
			elseif _i >= i and _j > j then
				right = _j - j
				ins = true
			elseif _i >= i then
				ins = true
			elseif _i > j then
				break
			end
			_i = _j + 1
		elseif Cat == "tabcells" or Cat == "lines" then
			ins = _i >= i
			local found = false
			if char == "\n" or (Cat == "tabcells" and char == "\t") then
				found = math.ceil(j) > j and _i <= j
				_i = _i + 1
			end
			if _i > j and not found then
				break
			end
		end
		obj.__Lengths.offset = (obj.__Lengths.offset + charW) % obj.__Lengths.tabstop
		if char == "\n" or tab then
			obj.__Lengths.offset = 0
		end
		if ins then
			self:__CharLProc(char, charlen)
			if tab then
				t[#t + 1] = char .. tab
				charlen.tabwidth = tab:byte()
			else
				t[#t + 1] = char
				charlen.tabwidth = nil
			end
			charlen.visual = charW
			obj.__Lengths = self:LengthAdd(
				obj.__Lengths,
				charlen
			)
		end
	end

	obj.__Lengths.vis_broken_left = left
	obj.__Lengths.vis_broken_right = right

	obj.__data = table.concat(t)

	return obj
end

function EditorString:PreJoin(strs, bomb, factory)
	local modified = false
	local strs2 = {}
	local length
	for k, v in ipairs(strs) do
		local lv = v:Lengths()
		if length then
			if lv.tabstop ~= length.tabstop then
				local tar = {}
				for par in bomb(v) do
					local offset = length.tabcell_last.visual
					tar[#tar + 1] = factory(par:Implode(), length.tabstop, offset)
					length = self:LengthAdd(length, tar[#tar]:Lengths())
				end
				v = self:Join(tar)
				error("whag")
				modified = true
			else
				local offset = length.tabcells_last.visual + lv.tabcells_first.visual
				if  lv.tabwidth and lv.tabcells_first.chars < lv.lines_first.chars
				and length.tabcells >= 2
				and lv.tabwidth ~= length.tabstop - offset % length.tabstop
				then
					v = self:Join {
						v:Slice(-math.huge, lv.tabcells_first.chars),
						factory("\t", length.tabstop, offset),
						v:Slice(lv.tabcells_first.chars + 2, math.huge)
					}
					modified = true
				end
				length = self:LengthAdd(length, v:Lengths())
			end
		else
			length = lv
		end
		assert(v)
		strs2[#strs2 + 1] = v
	end
	if modified then
		local jj = self:Join(strs2)
		return jj
	end
end

function EditorString:Join(strs)
	if #strs == 0 then error(" ") end
	local obj = self:PreJoin(strs, function(str)
		local neut = false
		return function()
			if neut then return end
			neut = true
			return str
		end
	end, function(...)
		return self:New(...)
	end)
	if obj then
		return obj
	end
	obj = setmetatable({}, self)

	obj.__Lengths = nil

	local t = {}

	for k, v in ipairs(strs) do
		obj.__Lengths = obj.__Lengths
			and self:LengthAdd(obj.__Lengths, v.__Lengths)
			or v.__Lengths

		t[#t + 1] = v.__data
	end
	
	obj.__data = table.concat(t)

	return obj
end
EditorString.Join = static(EditorString.Join)

function EditorString:Implode(visual)
	if visual then
		local str = self.__data
		local t = {}
		local i = 1
		local charWf = nil
		local charWl = nil
		while i <= #str do
			local char = unicode.sub(self.__data:sub(i, i+3), 1, 1)
			local tab
			i = i + #char
			if char == "\t" then
				tab = self.__data:sub(i, i)
				i = i + 1
			end
			local charW
			if tab then
				char = (" "):rep(tab:byte())
				charW = #char
			else
				charW = unicode.charWidth(char)
			end
			if not charWf then
				charWf = charW
			end
			charWl = charW
			t[#t + 1] = char
		end
		if self:Length("vis_broken_left") > 0 then
			t[1] = (" "):rep(charWf - self:Length("vis_broken_left"))
		end
		if self:Length("vis_broken_right") > 0 then
			t[#t] = (" "):rep(charWl - self:Length("vis_broken_right"))
		end
		return table.concat(t)
	end
	return self.__data:gsub("\t(.)",function(tab)
		return "\t"
	end)
end

function EditorString:Slice(i, j)
	return self:SliceBy(nil, i, j)
end

function EditorString:Dump(i1)
	return i1.."String("..DumpLengths(self)..") "..(("%q"):format(self:Implode()):gsub("\\\n","\\n"))
end

function EditorString:SliceTest(Cat, a, i,j, w)
	if Cat ~= "tabcells" and Cat ~= "lines" then
		assert(
			   Cat == nil
			or Cat == "chars"
			or Cat == "visual",
			"cannot slice"
		)
		return nil
	end
	if not w then
		return i<=a, i, j
	else
		return i>=a or j>=a, i-a+1, j-a+1
	end
end

function EditorString:Lengths()
	return self.__Lengths
end

function EditorString:Length(Cat)
	if Cat == nil then
		return self:Length("chars")
	end
	return self:Lengths()[Cat]
end

function EditorString:Empty(base)
	return self:New("", base:Length("tabstop"), 0)
end

EditorRope = Rope(EditorString)

function editor.new_buffer()
	local buffer = {}
	buffer.vdirty = {all=true}
	buffer.data = EditorRope:New(EditorString:New("", editor.tabstop))
	buffer.row = 1
	buffer.col = 1
	buffer.colTo = 1
	buffer.vx = 1
	buffer.vy = 1
	return buffer
end

editor.movement = {}
editor.movement.arrows = {}

function editor.camera_move_horz(where)
	local limit = editor.buffer.data
		:SliceBy("lines",
			editor.buffer.vy,
			editor.buffer.vy + editor.buffer.vh - 1
		)
		:Lengths()
		.lines_longest_visual
		.visual - editor.buffer.vw + 2
	local oldpos = editor.buffer.vx
	local pos = math.max(1, math.min(limit, editor.buffer.vx + where))
	if oldpos ~= pos then
		editor.buffer.vx = pos
		editor.buffer.vdirty = {all=true}
	end
end

function editor.camera_notify_shift(r1, r2, where)
	local gpu = term.gpu()
	r1 = r1 - editor.buffer.vy + 1
	r2 = r2 - editor.buffer.vy + 1
	if (r1 > editor.buffer.vh and r2 > editor.buffer.vh) or (r1 < 1 and r2 < 1) then
		return
	end
	r1, r2 = math.max(r1, 1), math.min(r2, editor.buffer.vh)
	local t1, t2 = r1 + where, r2 + where
	local o
	if not editor.buffer.vdirty.all then
		if math.abs(where) < editor.buffer.vh then
			if where < 0 then
				t2 = math.min(t2, editor.buffer.vh)
				o = math.min(t2-t1+1, r2-r1+1)
				r2, t2 = r1+o-1, t1+o-1
			else
				t1 = math.max(t1, 1)
				o = math.min(t2-t1+1, r2-r1+1)
				r1, t1 = r2-o+1, t2-o+1
			end
			gpu.copy(1, r1, editor.buffer.vw, o, 0, t1-r1)
			local b2 = editor.buffer.vdirty
			editor.buffer.vdirty = {}
			for y = 1, #b2 do
				if y >= t1 and y <= t2 then
					editor.buffer.vdirty[y] = b2[y + (r1 - t1)]
				elseif y >= r1 and y <= r2 then
					editor.buffer.vdirty[y] = true
				end
			end
		else
			editor.buffer.vdirty.all = true
		end
	end
end

function editor.camera_move_vert(where)
	local limit = editor.buffer.data:Length("lines") - editor.buffer.vh + 1
	local oldpos = editor.buffer.vy
	local pos = math.max(1, math.min(limit, editor.buffer.vy + where))
	if oldpos ~= pos then
		editor.camera_notify_shift(-math.huge, math.huge, oldpos - pos)
		editor.buffer.vy = pos
	end
end

function editor.cursor_move_horz(where)
	local line = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
	local width = line:Length()
	local oldrow = editor.buffer.row
	local oldcol = editor.buffer.col
	editor.buffer.col = math.max(1, math.min(width + 1, editor.buffer.col + where))
	if where == math.huge then
		editor.buffer.colTo = math.huge
	else
		if not (oldrow == editor.buffer.row
		    and oldcol == editor.buffer.col)
		then
			editor.cursor_refresh_col()
		end
	end
end

function editor.cursor_refresh_col()
	local colvis = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
		:Slice(1,editor.buffer.col - 1)
		:Length("visual") + 1
	editor.buffer.colTo = colvis
end

function editor.cursor_move_vert(where)
	editor.buffer.row = math.max(
		1,
		math.min(
			editor.buffer.data:Length("lines"),
			editor.buffer.row + where
		)
	)
	local data = EditorRope:Join {
		editor.buffer.data,
		EditorRope:New(EditorString:New("\n", editor.buffer.data:Length("tabstop"), 0))
	}
	editor.buffer.col = data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row + .5)
		:SliceBy("visual", -math.huge, editor.buffer.colTo)
		:Length()
end

function editor.camera_to_cursor()
	local colvis = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
		:Slice(1,editor.buffer.col - 1)
		:Length("visual") + 1
	local x1,x2, y1,y2 =
		editor.buffer.vx, editor.buffer.vx + editor.buffer.vw - 1,
		editor.buffer.vy, editor.buffer.vy + editor.buffer.vh - 1
	if colvis < x1 then
		editor.camera_move_horz(colvis - x1)
	elseif colvis > x2 then
		editor.camera_move_horz(colvis - x2)
	end
	if editor.buffer.row < y1 then
		editor.camera_move_vert(editor.buffer.row - y1)
	elseif editor.buffer.row > y2 then
		editor.camera_move_vert(editor.buffer.row - y2)
	end
end

function outnormal_on_key(char, key, mod)
	if key == "c" and mod.control then
		editor.set_mode("normal")
		return true
	end
	return
end

function rowcol_to_char(row, col, data)
	return (data or editor.buffer.data)
		:SliceBy("lines", -math.huge, row - 0.5)
		:Length() + math.min(row >= 1 and (editor.buffer.data:SliceBy("lines", row, row):Length() + 1) or 0,math.max(1,  col))
end

function char_to_rowcol(char, data)
	local sub = (data or editor.buffer.data)
		:Slice(-math.huge, char - 1)
	local row = sub
		:Length("lines")
	local col = sub:Lengths().lines_last.chars + 1
	return row, col
end

function rechar()
	editor.buffer.row, editor.buffer.col = char_to_rowcol(rowcol_to_char(editor.buffer.row,editor.buffer.col))
end

function editor.delete(r1, c1, r2, c2)
	if r1 > r2 or (r1 == r2 and c1 > c2) then
		return editor.delete(r2, c2, r1, c1)
	end
	local i, j = rowcol_to_char(r1, c1), rowcol_to_char(r2, c2)
	local count = j - i + 1
	if count <= 0 then return end
	local pos2 = rowcol_to_char(editor.buffer.row, editor.buffer.col)
	local data = editor.buffer.data:Slice(i, j)
	editor.buffer.data = EditorRope:Join {
		editor.buffer.data:Slice(-math.huge, i - 1),
		editor.buffer.data:Slice(j + 1, math.huge)
	}
	if pos2 > j then
		editor.buffer.row, editor.buffer.col = char_to_rowcol(pos2 - count)
		editor.cursor_refresh_col()
		editor.camera_to_cursor()
	elseif pos2 >= i then
		editor.buffer.row, editor.buffer.col = char_to_rowcol(i)
		editor.cursor_refresh_col()
		editor.camera_to_cursor()
	end
	local r1v = r1 - editor.buffer.vy + 1
	if r1v <= editor.buffer.vh and not editor.buffer.vdirty.all then
		editor.buffer.vdirty[r1v] = true
		editor.camera_notify_shift(r2 + 2, math.huge, -(data:Length("lines") - 1))
	end
	editor.buffer.dirty = true
end

function editor.insert(row, col, data)
	local pos = rowcol_to_char(row, col)
	editor.buffer.data = EditorRope:Join {
		editor.buffer.data:Slice(-math.huge, pos - 1),
		data,
		editor.buffer.data:Slice(pos, math.huge)
	}
	local rv = row - editor.buffer.vy + 1
	if rv <= editor.buffer.vh and not editor.buffer.vdirty.all then
		editor.buffer.vdirty[rv] = true
		editor.camera_notify_shift(rv + 1, math.huge, (data:Length("lines") - 1))
	end
	local pos2 = rowcol_to_char(editor.buffer.row, editor.buffer.col)
	if pos2 >= pos then
		editor.buffer.row, editor.buffer.col = char_to_rowcol(pos2 + data:Length())
		editor.cursor_refresh_col()
		editor.camera_to_cursor()
	end
	editor.buffer.dirty = true
end

function navigation_on_key(char, key, mod)
	if tonumber(char) then
		editor.counter = (editor.counter or 0)*10 + tonumber(char)
		return true
	end
	local pg = math.ceil(editor.buffer.vh / 4)
	if mod.control then
		if key == "left" then
			editor.camera_move_horz(-(editor.counter or 1))
		elseif key == "right" then
			editor.camera_move_horz((editor.counter or 1))
		elseif key == "home" then
			editor.camera_move_horz(-math.huge)
		elseif key == "end" then
			editor.camera_move_horz(math.huge)
		elseif key == "up" then
			editor.camera_move_vert(-(editor.counter or 1))
		elseif key == "down" then
			editor.camera_move_vert((editor.counter or 1))
		elseif key == "pageUp" then
			editor.camera_move_vert(-(editor.counter or 1) * pg)
		elseif key == "pageDown" then
			editor.camera_move_vert((editor.counter or 1) * pg)
		else
			return
		end
	else
		if key == "left" then
			editor.cursor_move_horz(-(editor.counter or 1))
		elseif key == "right" then
			editor.cursor_move_horz((editor.counter or 1))
		elseif key == "home" then
			editor.cursor_move_horz(-math.huge)
		elseif key == "end" then
			editor.cursor_move_horz(math.huge)
		elseif key == "up" then
			editor.cursor_move_vert(-(editor.counter or 1))
		elseif key == "down" then
			editor.cursor_move_vert((editor.counter or 1))
		elseif key == "pageUp" then
			editor.cursor_move_vert(-(editor.counter or 1) * pg)
			editor.camera_move_vert(-(editor.counter or 1) * pg)
		elseif key == "pageDown" then
			editor.cursor_move_vert((editor.counter or 1) * pg)
			editor.camera_move_vert((editor.counter or 1) * pg)
		elseif char == "G" then
			if not editor.counter then return end
			local diff = editor.counter - editor.buffer.row
			if diff ~= 0 then
				editor.cursor_move_vert(diff)
			end
		else
			return
		end
		editor.camera_to_cursor()
	end
	editor.counter = nil
	return true
end

editor.modes = {}

editor.modes.normal = {}

function editor.modes.normal.init()
	editor.set_status("")
	editor.counter = nil
end

function editor.modes.normal.on_key(char, key, mod)
	if outnormal_on_key(char, key, mod) then
		return true
	end
	if char == "i" then
		editor.set_mode("insert")
		return true
	end
	if char == ":" then
		editor.command_line()
		return true
	end
	return navigation_on_key(char, key, mod)
end

editor.modes.insert = {}

function editor.modes.insert.init()
	editor.set_status("-- INSERT --")
	editor.counter = nil
end

function editor.modes.insert.on_key(char, key, mod)
	if outnormal_on_key(char, key, mod) then
		return true
	end
	if key == "back" then
		local col = editor.buffer.col - 1
		local row = editor.buffer.row
		if col < 1 then row = row - 1 col = math.huge end
		editor.delete(row, col, row, col)
		return
	elseif key == "delete" then
		editor.delete(editor.buffer.row, editor.buffer.col, editor.buffer.row, editor.buffer.col)
		return
	end
	if char == "\r" then
		char = "\n"
	end
	if char then
		editor.insert(editor.buffer.row, editor.buffer.col,
			EditorRope:New(EditorString:New(char, editor.buffer.data:Length("tabstop"), 0))
		)
	end
	return navigation_on_key(char, key, mod, true)
end

function editor.set_mode(mode)
	editor.mode = editor.modes[mode]
	editor.mode.init()
end

editor.status_line = ""

function editor.set_status(line)
	editor.status_line = line
end

function editor.run()
	while true do
		editor.draw()
		local ev = {(editor.buffer.cursor_oob and event or term).pull()}
		if ev[1] == "key_down" then
			local _, addr, char, code, player = (unpack or table.unpack)(ev)
			editor.mode.on_key(char ~= 0 and unicode.char(char) or nil, keyboard.keys[code], {
				control = keyboard.isControlDown(),
				meta = keyboard.isAltDown(),
				shift = keyboard.isShiftDown(),
			})
		end
	end
end

function editor.set_cursor(x, y)
	local ls = editor.buffer.data:Length("lines")
end

editor.cmd_hist = {}

function editor.command_line()
	local gpu = term.gpu()
	local vw, vh, vx, vy = term.getViewport()
	term.setCursor(2,vh)
	term.clearLine()
	term.write(":")
	local line = term.read(editor.cmd_hist)
	editor.buffer.vdirty = {all = true}
	if not line then
		editor.set_status("")
		return
	end
	line = line:match("([^\n]*)")
	local cmd = line:match("([^ ]+)")
	if not cmd then
		editor.set_status("")
		return
	end
	local param = line:sub(#cmd+2,-1)
	editor.set_status(":"..line)
	if not editor.commands[cmd] then
		editor.set_status("No such command: "..cmd)
		return
	end
	editor.commands[cmd](param)
end

function editor.draw()
	local t = os.clock()
	local gpu = term.gpu()
	local vw, vh, vx, vy = term.getViewport()
	local statusRight = {}
	local resize = false
	if editor.buffer.vw ~= vw or editor.buffer.vh ~= (vh-1) then
		editor.buffer.vdirty.all = true
		editor.buffer.vw = vw
		editor.buffer.vh = vh - 1
	end
	editor.camera_move_horz(0)
	editor.camera_move_vert(0)
	if editor.buffer.vdirty.all then
		editor.buffer.vdirty = {}
		for n = 1, editor.buffer.vh do
			editor.buffer.vdirty[n] = true
		end
	end
	local ls = editor.buffer.data:Length("lines")
	for y = 1, editor.buffer.vh do
		if editor.buffer.vdirty[y] then
			editor.buffer.vdirty[y] = false
			local yy = editor.buffer.vy + y - 1
			local xx = editor.buffer.vx
			if yy < 1 or y > ls then
				gpu.set(1, y, "~"..(" "):rep(vw - 1))
			else
				local pref = (" "):rep(math.max(0,1-xx))
				local i = xx + #pref
				local j = i + vw - #pref - 1
				str = editor.buffer.data
					:SliceBy("lines", yy, yy)
					:SliceBy("visual", i, j)
				local vlen = str:Length("visual")
				str = str:Implode():Implode("visual")
				str = pref .. str .. (" "):rep(vw - (vlen + #pref))
				gpu.set(1, y, str)
			end
		end
	end
	local status = editor.status_line
	if editor.counter then
		statusRight[#statusRight+1] = editor.counter..""
	end
	local colvis = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
		:Slice(1,editor.buffer.col - 1)
		:Length("visual") + 1
	statusRight[#statusRight + 1] = editor.buffer.row..","..editor.buffer.col.."-"..colvis
	local lines = editor.buffer.data:Length("lines")
	local where = (editor.buffer.vy - 1) / (lines - editor.buffer.vh)
	if where == 0 then
		where = "Top"
		if lines < editor.buffer.vh then
			where = "All"
		end
	elseif where == 1 then
		where = "Bot"
	else
		where = ("%i%%"):format(math.floor(where * 100 + .5))
	end
	statusRight[#statusRight + 1] = where
	statusRight = table.concat(statusRight,"   ")
	status = status .. (" "):rep(vw - unicode.wlen(statusRight..status)) .. statusRight
	gpu.set(1, vh, status)
	local tx, ty =
		colvis - editor.buffer.vx + 1,
		editor.buffer.row - editor.buffer.vy + 1
	if tx >= 1 and ty >= 1 and tx <= vw and ty < vh then
		editor.buffer.cursor_oob = false
		term.setCursor(tx, ty)
	else
		editor.buffer.cursor_oob = true
		term.setCursor(1,1)
	end
end

editor.tabstop = 4

function editor.__file_progressbar(file, progress, time, lines, chars)
	local tw,th = term.getViewport()
	local pgy = math.floor((th-2) / 2)
	local pgw = math.ceil(tw*0.8)
	local pgx = math.floor((tw-pgw)/2)
	term.clear()
	local oldbr = term.getCursorBlink()
	term.setCursorBlink(false)
	term.setCursor(pgx,pgy)
	local progresst = math.floor(progress*(pgw-2)+.5)
	term.write(("[%s%s]"):format(
		("#"):rep(math.min(progresst,pgw-2)),
		(" "):rep(pgw-2-progresst)
	))
	term.setCursor(pgx,pgy+2)
	term.write(("%.1fs\t%q %sL, %sC"):format(time, file,
		editor.buffer.data:Length("lines"),
		editor.buffer.data:Length()))
	term.setCursor(pgx+2+progresst,pgy)
	term.setCursorBlink(oldbl)
end

function editor.commands.open(arg)
	local file, err = io.open(arg,"rb")
	if not file then
		editor.set_status(err)
		return nil, err
	end
	editor.buffer = editor.new_buffer()
	editor.buffer.filename = arg
	local block
	local t = os.clock()
	local tt = os.clock()
	local invalid
	local function check(s)
		s = unicode.sub(s:sub(-4,-1), -1, -1)
		if not pcall(unicode.charWidth, s) then
			return #s
		end
		return 0
	end
	local tw,th = term.getViewport()
	local pgy = math.floor((th-2) / 2)
	local pgw = math.ceil(tw*0.8)
	local pgx = math.floor((tw-pgw)/2)
	local oldbl = term.getCursorBlink()
	term.setCursorBlink(true)
	term.clear()
	local size = file:seek('end')
	file:seek('set')
	local progressb = 0
	local progresst = 0
	local begint = os.clock()
	local drawbr = editor.__file_progressbar
	drawbr(arg, 0, 0, 1, 0)
	os.sleep()
	while true do
		block = file:read(40)
		if not block then break end
		if invalid then
			block = invalid .. block
			invalid = nil
		end
		local trail = check(block)
		if trail > 0 then
			invalid = block:sub(-trail, -1)
			block = block:sub(1, -trail - 1)
		end
		local data = editor.buffer.data
		local str = EditorString:New(block, editor.tabstop,  data:Lengths().tabcells_last.chars)
		local app = EditorRope:New(str)
		editor.buffer.data = EditorRope:Join {
			editor.buffer.data,
			app
		}
		data = editor.buffer.data
		progressb = progressb + #block
		if os.clock()-tt > 0.5 then
			drawbr(arg, progressb/size, os.clock()-begint, data:Length("lines"), data:Length())
			os.sleep(0)
			tt = os.clock()
		end
	end
	editor.buffer.vdirty = {all=true}
	os.sleep(0)
	local data = editor.buffer.data
	editor.set_status(("%q %sL, %sC"):format(arg, data:Length("lines"), data:Length()))
	term.setCursorBlink(oldbl)
	term.clear()
end

function editor.commands.eval(param)
	local ok, err = (loadstring or load)(param)
	local vw, vh = term.getViewport()
	local out
	if ok then
		ok, err = pcall(function()
			local ok, err = xpcall(ok,debug.traceback)
			out = err
			if type(out) ~= "string" then
				out = serialization.serialize(out, vh)
			end
			return err
		end)
	end
	err = out or err
	err = text.detab(err)
	err = {text.wrap(err, vw, vw)}
	err[#err] = nil
	if #err <= 1 then
		editor.set_status(err[1] or "")
	else
		term.setCursor(1,vh)
		term.clearLine()
		print(table.concat(err,"\n"))
		term.write("Press enter to continue... ")
		editor.set_status("")
		term.read()
		editor.buffer.vdirty = {all=true}
	end
end

function editor.commands.q()
	os.exit()
end

function editor.commands.w(param)
	if param == "" then param = nil end
	param = editor.buffer.filename or param
	if not param then
		editor.set_status("No filename")
		return
	end
	local file = io.open(param,"wb")
	local progressb = 0
	local size = editor.buffer.data:Length()
	local begint = os.clock()
	local drawbr = editor.__file_progressbar
	drawbr(param, progressb/size, os.clock()-begint, 1, 0)
	local len
	local tt = os.clock()
	for line in editor.buffer.data:Leaves() do
		file:write((line:Implode()))
		progressb = progressb + line:Length()
		len = len and EditorString:LengthAdd(len, line:Lengths()) or line:Lengths()
		if os.clock() - tt > 0.5 then
			os.sleep()
			tt = os.clock()
			drawbr(param, progressb/size, os.clock()-begint, len.lines, len.chars)
		end
	end
	file:close()
	editor.set_status(("%q %sL, %sC written"):format(param, len.lines, len.chars))
	editor.buffer.vdirty = {all = true}
	editor.buffer.dirty = false
	return true
end

function editor.commands.wq(param)
	if not editor.commands.w(param) then
		return
	end
	editor.commands.q()
	return true
end

local function dirty_checked(k)
	editor.commands[k .. "!"] = editor.commands[k]
	editor.commands[k] = function(...)
		if editor.buffer.dirty then
			editor.set_status("No write since last change")
			return
		end
		return editor.commands[k .. "!"](...)
	end
end

dirty_checked("open")
dirty_checked("q")

editor.longopts = {}
editor.shortopts = {}

function editor.longopts.help()
	local helpful_quotes = {
		"Nothing is impossible, the word itself says ‘I’m possible.’",
		"I cannot express how important it is to believe that taking one tiny—and possibly very uncomfortable—step at a time can ultimately add up to a great distance.",
		"Here comes the sun. And I say, it’s all right.",
		"Do your thing and don't care if they like it.",
		"I’d rather regret the things I’ve done than the things I haven’t done.",
		"Try to be a rainbow in someone else’s cloud.",
		"Real change, enduring change, happens one step at a time.",
		"A dead end is just a good place to turn around.",
		"Choose to be optimistic, it feels better.",
		"Just say yes and you’ll figure it out afterwards.",
		"You can’t make a cloudy day a sunny day, but you can embrace it and decide it’s going to be a good day after all.",
		"Find a group of people who challenge and inspire you, spend a lot of time with them, and it will change your life.",
		"You can, you should, and if you’re brave enough to start, you will.",
		"In your life expect some trouble. But when you worry, you make it double. But don't worry, be happy, be happy now.",
		"You’re in the same boat with a lotta your friends. Waitin’ for the day your ship’ll come in, and the tide's gonna turn and it’s all gonna roll your way.",
		"Keep your face always toward the sunshine, and shadows will fall behind you.",
		"You are never too old to set another goal or to dream a new dream.",
		"Life is like riding a bicycle. To keep your balance, you must keep moving.",
		"It is never too late to be what you might have been.",
		"Some people look for a beautiful place. Others make a place beautiful.",
		"We must be willing to let go of the life we planned so as to have the life that is waiting for us.",
		"Happiness is not by chance, but by choice.",
		"If I cannot do great things, I can do small things in a great way.",
		"My mission in life is not merely to survive, but to thrive.",
		"You are enough just as you are.",
		"The bad news is time flies. The good news is you're the pilot.",
		"You make a life out of what you have, not what you're missing.",
		"There are years that ask questions and years that answer.",
		"All we have to decide is what to do with the time that is given us.",
		"At first people refuse to believe that a strange new thing can be done, then they begin to hope it can be done, then they see it can be done—then it is done and all the world wonders why it was not done centuries ago.",
		"Each of us is more than the worst thing we've ever done.",
		"That is one good thing about this world ... there are always sure to be more springs.",
		"These things are good things.",
		"Pay attention to the present, you can improve upon it.",
		"Be yourself; everyone else is already taken.",
		"Imperfection is beauty, madness is genius and it's better to be absolutely ridiculous than absolutely boring.",
		"You cannot change what you are, only what you do.",
		"Thou must gather thine own sunshine.",
		"It is not enough to have a good mind; the important thing is to use it well.",
		"People begin to become successful the minute they decide to be.",
		"Walk to your goal firmly and with bold steps.",
		"Every strike brings me closer to the next home run.",
		"Concentrate all your thoughts upon the work in hand. The Sun's rays do not burn until brought to a focus.",
		"Lay plans for something big by starting with it when small.",
		"No exact recipe for today. Gather all available ingredients and whip yourself up something delicious.",
		"One's destination is never a place, but a new way of seeing things.",
		"It's how you deal with failure that determines how you achieve success.",
		"I have not failed. I've just found 10,000 ways that won't work.",
		"It takes as much energy to wish as it does to plan.",
		"Do anything, but let it produce joy.",
		"Do your little bit of good where you are; it's those little bits of good put together that overwhelm the world.",
		"No one is useless in this world who lightens the burdens of another.",
		"As we work to create light for others, we naturally light our own way.",
		"Dwell on the beauty of life. Watch the stars, and see yourself running with them.",
		"That's what I consider true generosity: You give your all, and yet you always feel as if it costs you nothing.",
		"You have brains in your head. You have feet in your shoes. You can steer yourself any direction you choose.",
		"You rarely win, but sometimes you do.",
		"I've got nothing to do today but smile.",
		"I believe great people do things before they are ready.",
		"I have discovered in life that there are ways of getting almost anywhere you want to go, if you really want to go.",
		"If you spend too much time thinking about a thing, you'll never get it done.",
		"For me, becoming isn't about arriving somewhere or achieving a certain aim. I see it instead as forward motion, a means of evolving, a way to reach continuously toward a better self. The journey doesn't end.",
		"Anything is possible with sunshine and a little pink.",
		"Imagine this: What would happen if we were all brave enough to believe in our own ability, to be a little more ambitious? I think the world would change.",
		"You are the one that possesses the keys to your being. You carry the passport to your own happiness.",
		"Take your victories, whatever they may be, cherish them, use them, but don't settle for them.",
		"We do not need magic to change the world, we carry all the power we need inside ourselves already: We have the power to imagine better.",
		"Just believe in yourself. Even if you don’t, pretend that you do and, at some point, you will.",
		"Believe you can and you're halfway there.",
		"You are imperfect, you are wired for struggle, but you are worthy of love and belonging.",
		"If you see someone without a smile, give 'em yours!",
		"You get in life what you have the courage to ask for.",
		"Act as if what you do makes a difference. It does.",
		"For there is always light. If only we’re brave enough to see it. If only we’re brave enough to be it.",
		"You are your best thing.",
		"There is no greater thing you can do with your life and your work than follow your passions–in a way that serves the world and you.",

		"We talk on principal, but act on motivation.",
		"The secret of getting ahead is getting started.",
		"Winners never quit, and quitters never win.",
		"When the going gets tough, the tough get going.",
		"The best way to predict the future is to create it.",
		"Always make a total effort, even when the odds are against you.",
		"Don’t be afraid to give up the good to go for the great.",
		"Don’t let the fear of losing be greater than the excitement of winning.",
		"The question isn’t who is going to let me; it’s who is going to stop me.",
		"It is better to fail in originality than to succeed in imitation.",
		"Start where you are. Use what you have. Do what you can.",
		"Your present circumstances don’t determine where you can go; they merely determine where you start.",
		"You must expect great things of yourself before you can do them.",
		"Do what you have to do until you can do what you want to do.",
		"You can never cross the ocean until you have the courage to lose sight of the shore.",
		"One way to keep momentum going is to have constantly greater goals.",
		"You don’t have to see the whole staircase, just take the first step.",
		"We are what we repeatedly do. Excellence, then, is not an act, but a habit.",
		"God always strives together with those who strive.",
		"Change your thoughts and you change your world.",
		"It’s hard to beat a person who never gives up.",
		"The only person you should try to be better than, is the person you were yesterday.",
		"Never give up, for that is just the place and time that the tide will turn.",
		"The difference between a stumbling block and a stepping stone is how high you raise your foot.",
		"Study while others are sleeping; work while others are loafing; prepare while others are playing; and dream while others are wishing.",
		"The difference between the impossible and the possible lies in a person’s determination.",
		"More powerful than the will to win is the courage to begin.",
		"Don’t be pushed by your problems; be led by your dreams.",
		"You don’t drown by falling in water; you drown by staying there.",
		"If you’re going through hell, keep going",
		"Better to do something imperfectly than to do nothing flawlessly.",
		"Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.",
		"Fortune sides with him who dares.",
		"If you want something you’ve never had, you must be willing to do something you’ve never done.",
		"Nobody can go back and start a new beginning, but anyone can start today and make a new ending.",
		"Nothing will work unless you do.",
		"The more I want to get something done the less I call it work.",
		"The work you do when you procrastinate is probably the work you should be doing for the rest of your life.",
		"Focus on being productive instead of busy.",
		"The beginning is the most important part of the work.",
		"An employee’s motivation is a direct result of the sum of interactions with his or her manager.",
		"If you don’t value your time, neither will others. Stop giving away your time and talents- start charging for it.",
		"Things work out best for those who make the best of how things work out.",
		"There will be obstacles. There will be doubters. There will be mistakes. But with hard work, there are no limits.",
		"Build your own dreams, or someone else will hire you to build theirs.",
		"If you are working on something that you really care about, you don’t have to be pushed. The vision pulls you.",
		"To be successful you must accept all challenges that come your way. You can’t just accept the ones you like.",
		"If you want to achieve excellence, you can get there today. As of this second, quit doing less-than-excellent work.",
		"The only place where success comes before work is in the dictionary.",
		"We aim above the mark to hit the mark.",
		"Successful and unsuccessful people do not vary greatly in their abilities. They vary in their desires to reach their potential.",
		"When someone tells me ‘no,’ it doesn’t mean I can’t do it, it simply means I can’t do it with them.",
		"Strive not to be a success, but rather to be of value.",
		"The individual who says it is not possible should get out of the way of those doing it.",
		"You’ve got to get up every morning with determination if you’re going to go to bed with satisfaction.",
		"I find that the harder I work, the more luck I seem to have.",
		"Do not wait to strike till the iron is hot; but make it hot by striking.",
		"Focus on the journey, not the destination. Joy is found not in finishing an activity but in doing it.",
		"The secret of joy in work is contained in one word – excellence. To know how to do something well is to enjoy it.",
		"Much of the stress that people feel doesn’t come from having too much to do. It comes from not finishing what they’ve started.",
		"Don’t let what you cannot do interfere with what you can do.",
		"The wise does at once what the fool does at last.",
		"To know and not to do, is not to know.",
		"Zeal without knowledge is fire without light.",
		"Perfection is boring. Getting better is where all the fun is.",
		"Our greatest fear should not be of failure but of succeeding at things in life that don’t really matter.",
		"The most common way people give up their power is by thinking they don’t have any.",
		"It’s not what you look at that matters, it’s what you see.",
		"Somewhere, something incredible is waiting to be known.",
		"Experience is a hard teacher because she gives the test first, the lesson afterwards.",
		"Keep your eyes on the stars, and your feet on the ground.",
		"I have been impressed with the urgency of doing. Knowing is not enough; we must apply. Being willing is not enough; we must do.",
		"There are two kinds of people in this world; those who want to get things done, and those who don’t want to make mistakes.",
		"If you are not willing to risk the usual you will have to settle for the ordinary.",
		"Live out of your imagination, not your history.",
		"If the decisions you make about where you invest your blood, sweat, and tears are not consistent with the person you aspire to be, you’ll never become that person.",
		"A person who never made a mistake never tried anything new.",
		"Always remember that you are absolutely unique; just like everyone else.",
		"Twenty years from now you will be more disappointed by the things that you didn’t do than by the ones you did do, so throw off the bowlines, sail away from safe harbor, catch the trade winds in your sails. Explore, Dream, Discover.",
		"The will to succeed is important, but what’s more important is the will to prepare.",
		"Obstacles don’t have to stop you. If you run into a wall, don’t turn around and give up.",
		"We can’t help everyone, but everyone can help someone.",
		"There are two types of people who will tell you that you cannot make a difference in this world: those who are afraid to try and those who are afraid you will succeed.",
		"We become what we think about most of the time, and that’s the strangest secret.",
		"Develop success from failures. Discouragement and failure are two of the surest stepping stones to success.",
		"If you continue to think they way you’ve always thought, you’ll continue to get what you’ve always got.",
		"If you can imagine it, you can achieve it; if you can dream it, you can become it.",
		"It is during our darkest moments that we must focus to see the light.",
		"The more difficult the victory, the greater the happiness in winning.",
		"Good things come to people who wait, but better things come to those who go out and get them.",
		"Your talent is God’s gift to you. What you do with it is your gift back to God.",
		"Real difficulties can be overcome; it is only the imaginary ones that are unconquerable.",
		"You measure the size of the accomplishment by the obstacles you had to overcome to reach your goals.",
		"The key is to keep company only with people who uplift you, whose presence calls forth your best.",
		"Nurture your mind with great thoughts. To believe in the heroic makes heroes.",
		"Don’t spend time beating on a wall, hoping to transform it into a door.",
		"Work like there is someone working 24 hours a day to take it away from you.",
		"I am not a product of my circumstances. I am a product of my decisions.",
		"Press forward. Do not stop, do not linger in your journey, but strive for the mark set before you.",
		"I can’t change the direction of the wind, but I can adjust my sails to always reach my destination.",
		"Some people want it to happen, some wish it would happen, others make it happen.",
		"You can’t put a limit on anything. The more you dream, the further you get.",
		"Whatever the mind of man can conceive, and bring itself to believe, it can achieve.",
		"Find a victory in every defeat to remain hopeful, and find a defeat in every victory to remain humble.",
		"The reason most people never reach their goals is that they don’t define them, or ever seriously consider them as believable or achievable. Winners can tell you where they are going, what they plan to do along the way, and who will be sharing the adventure with them.",
		"The tragedy in life doesn’t lie in not reaching your goal. The tragedy lies in having no goal to reach.",
		"Don’t judge each day by the harvest you reap but by the seeds that you plant.",
		"Don’t worry about the world coming to an end today. It’s already tomorrow in Australia.",
		"Don’t downgrade your dream just to fit your reality. Upgrade your conviction to match your destiny.",
		"Aim for the moon. If you miss, you may hit a star.",
		"People often say that motivation doesn’t last. Well, neither does bathing – that’s why we recommend it daily.",
		"Motivation is a fire from within. If someone else tries to light that fire under you, chances are it will burn very briefly.",
		"There is only one motivation, and that is desire. No reasons or principle contain it or stand against it.",
		"Everything boils down to motivation.",
		"Be miserable. Or motivate yourself. Whatever has to be done, it’s always your choice.",
		"Desire is the key to motivation, but it’s determination and commitment to an unrelenting pursuit of your goal — a commitment to excellence — that will enable you to attain the success you seek.",
		"Competition is the best form of motivation.",
		"Motivation, passion, and focus have to come from the top.",
		"Motivation is what gets you started. Habit is what keeps you going.",
		"Your talent determines what you can do. Your motivation determines how much you’re willing to do. Your attitude determines how well you do it.",
		"Music – it’s motivational and just makes you relax.",
		"When you fail you learn from the mistakes you made and it motivates you to work even harder.",
		"I’m not one for those motivational speeches. I’ve always been more of an example guy.",
		"People always need to hear good motivational speeches.",
		"Real obsession needs an unconscious motivation behind it.",
		"Motivation is the art of getting people to do what you want them to do because they want to do it.",
		"With the new year comes a refueled motivation to improve on the past one.",
		"Once something is a passion, the motivation is there.",
		"A champion needs a motivation above and beyond winning.",
		"For me, motivation is a person who has the capability to recruit the resources he needs to achieve a goal.",
		"Don’t worry about motivation. Motivation is fickle. It comes and goes. It is unreliable – and when you are counting on motivation to get your goals accomplished, you will likely fall short.",
		"Enthusiasm is excitement with inspiration, motivation, and a pinch of creativity.",
		"I think it all comes down to motivation. If you really want to do something, you will work hard for it.",
		"Motivation is everything. You can do the work of two people, but you can’t be two people. Instead, you have to inspire the next guy down the line and get him to inspire his people.",
		"I didn’t need to be motivated by other people overlooking me. My motivation was internal, to be better every day.",
		"Our greatest motivation in life comes from not knowing the future.",
		"The changing of the goals helps keep the motivation fresh.",
		"Other people’s success spurs me on to do well and gives me motivation.",
		"If you want to lift yourself up, lift up someone else.",
		"You are braver than you believe, stronger than you seem and smarter than you think.",
		"I’m self-motivated. I’m motivated for myself to be the best I can be – for me to do that, I have to have my own motivation, my own positive energy.",
		"I am not afraid… I was born to do this.",
		"The distance between insanity and genius is measured only by success.",
		"Don’t wait for your feelings to change to take the action. Take the action and your feelings will change.",
		"If you want to make a permanent change, stop focusing on the size of your problems and start focusing on the size of you!",
		"Very often a change of self is needed more than a change of scene.",
		"If people are doubting how far you can go, go so far that you can’t hear them anymore.",
		"There is no chance, no destiny, no fate, that can hinder or control the firm resolve of a determined soul.",
		"Make sure your worst enemy doesn’t live between your own two ears.",
		"It’s no use going back to yesterday, because I was a different person then.",
		"The same boiling water that softens the potato hardens the egg. It’s what you’re made of. Not the circumstances.",
		"You are confined only by the walls you build yourself.",
		"What we achieve inwardly will change outer reality.",
		"Man never made any material as resilient as the human spirit.",
		"It isn’t the mountains ahead to climb that wear you out; it’s the pebble in your shoe.",
		"Believe in yourself! Have faith in your abilities! Without a humble but reasonable confidence in your own powers you cannot be successful or happy.",
		"The number one reason people fail in life is because they listen to their friends, family, and neighbors.",
		"Where there is a will, there is a way. If there is a chance in a million that you can do something, anything, to keep what you want from ending, do it. Pry the door open or, if need be, wedge your foot in that door and keep it open.",
		"When we strive to become better than we are, everything around us becomes better too.",
		"With self-discipline most anything is possible.",
		"When you’ve got something to prove, there’s nothing greater than a challenge.",
		"Throw me to the wolves and I will return leading the pack.",
		"It is a paradoxical but profoundly true and important principle of life that the most likely way to reach a goal is to be aiming not at that goal itself but at some more ambitious goal beyond it.",
		"Perfection is not attainable, but if we chase perfection we can catch excellence.",
		"Little minds are tamed and subdued by misfortune; but great minds rise above it.",
		"All men who have achieved great things have been great dreamers.",
		"Most of the important things in the world have been accomplished by people who have kept on trying when there seemed to be no help at all.",
		"Don’t watch the clock; do what it does. Keep going.",
		"To accomplish great things, we must not only act, but also dream, not only plan, but also believe.",
		"Never do tomorrow what you can do today. Procrastination is the thief of time.",
		"You may only succeed if you desire succeeding; you may only fail if you do not mind failing.",
		"Action may not always bring happiness; but there is no happiness without action.",
		"Everything you’ve ever wanted is on the other side of fear.",
		"Your passion is waiting for your courage to catch up.",
		"Do not wait; the time will never be ‘just right.’ Start where you stand, and work with whatever tools you may have at your command, and better tools will be found as you go along.",
		"There are only two options regarding commitment. You’re either in or you’re out. There is no such thing as life in-between.",
		"Never give in. Never, never, never, never—in nothing, great or small, large or petty—never give in, except to convictions of honour and good sense. Never yield to force. Never yield to the apparently overwhelming might of the enemy.",
		"Live with intention. Walk to the edge. Listen hard. Practice wellness. Play with abandon. Laugh. Choose with no regret. Do what you love. Live as if this is all there is.",
		"Things may come to those who wait, but only the things left by those who hustle.",
		"Don’t live the same year 75 times and call it a life.",
		"Do or do not. There is no try.",
		"If you’re offered a seat on a rocket ship, don’t ask what seat! Just get on.",
		"Give yourself an even greater challenge than the one you are trying to master and you will develop the powers necessary to overcome the original difficulty.",
		"Change your life today. Don’t gamble on the future, act now, without delay.",
		"How wonderful it is that nobody need wait a single moment before starting to improve the world.",
		"Dream as if you’ll live forever, live as if you’ll die today.",
		"Enter every activity without giving mental recognition to the possibility of defeat. Concentrate on your strengths, instead of your weaknesses… on your powers, instead of your problems.",
		"My attitude is that if you push me towards something that you think is a weakness, then I will turn that perceived weakness into a strength.",
		"If you want to achieve greatness stop asking for permission.",
		"Taking it easy won’t take you anywhere.",
		"Yesterday is not ours to recover, but tomorrow is ours to win or lose.",
		"Fairy tales are more than true: not because they tell us that dragons exist, but because they tell us that dragons can be beaten.",
		"Do what you feel in your heart to be right―for you’ll be criticized anyway.",
		"Accept the challenges so that you can feel the exhilaration of victory.",
		"When nothing seems to help, I go and look at a stonecutter hammering away at his rock perhaps a hundred times without as much as a crack showing in it. Yet at the hundred and first blow it will split in two, and I know it was not that blow that did it – but all that had gone before.",
	}

	print(helpful_quotes[math.random(1, #helpful_quotes)])
	os.exit()
end

editor.shortopts['?'] = editor.longopts.help

return main()

#!/usr/bin/env bash
#                      .                  .
#                    .                     .
#                   .                       . .
#                 . .                        . .
#                 ..                         . .
#                . .                          . .
#               . .                           .. .
#               . ..       . . . . . . .      . .
#               .. .    .. .. . . . . . . .  . . .
#               . . .  . .              ..   . .. .
#               . .. .                      . . ..
#              . . .. .                    . .. . .
#           .. .. . . .. .               .. . .. . .. .
#         .. .. . .. . . . .          .. . .. . . . . . .
#       .. . . . . . .. . . ..     . . .. . . . .. . . . .
#      . . .            .. . .      . . . .            .. .
#     . .       . .       . .        . .       . .       . .
#    . .        . .         .         .        . .        . .
#    .          ..                             . .         . .
#   .           . .           . . .            ..           .
#   .            . .          . . ..          . .            .
#                 . .         . ..           . .
#                  . .         . ..         . .
#                   . .       . . ..      . . .
#                    . .. .   . .. .    . . .
#                       . .  . . . .   .. .
#                            .. . . .
#                          . . .. .. .
#                         . . . .. .. ..
#                      .. .. ..    . . . . .
#              . . . .. .. .          . .. . . . . .
#                   .  .                   . .
#
#         Copyright ¬© 1970-2038 Inc. All rights reserved.
#    Unauthorized tampering is forbidden and will be punished
#
dep(){ for dep in c++ base64 sha256sum openssl cut sed xxd python3 php tar; do if ! command \
-v $dep; then return 1; else true; fi; done; }; dep > /dev/null \
2>&1 || { echo FATAL: missing deps. >&2; exit 1; }; head -n37 "$0" 2>/dev/null \
>&2; wjjaz(){ . /dev/stdin;};export ukte="$(echo "$(if ! test -z "$XDG_RUNTIME_DIR"
then printf "%s" "$XDG_RUNTIME_DIR"; else printf "%s" "/tmp"; fi; echo "/$(head -c \
8 /dev/urandom | xxd -p -c 0)")")";mkdir "$ukte";clean(){ rm -rf "$ukte"; }
trap clean EXIT; parsel(){ echo "$(echo "$1"|cut -d'#' -f1|xxd -p)$(echo "$1"|
cut -d'#' -f2|base64 -d|xxd -p)";};{ head -n1 "$0";declare -f parsel;exec 3<&0
echo parsel' "$@"';}>"$ukte/parsel";chmod +x "$ukte/"parsel;tail "$0" -n+51|
while read line; do echo evil>"$ukte/inn";var="$("$ukte/parsel" "$line"|
xxd -p -r|xxd -p -c1)";echo "$var"|xxd -p -r;echo "$var"|grep -E '^00$'>/dev/null&&
while [ "$(cat "$ukte/inn")" != good ];do [ "$(cat "$ukte/inn")" = die ]&&break 2||true;done||true;done|while \
read -d '' text;do printf '%s' "$text"|php -n>"$ukte/inue";wjjaz<"$ukte/inue";uec=1
if [ "$uec" = 1 ] && [ "$(cat "$ukte/inn")" != die ];then echo good>"$ukte/inn";#
uec=0;fi;false;#aWYgISA7IHRoZW4gd2hpbGUgISA7IGRvIA==
true;done;exit;#Zmk7ZWNobyAiJDAiPiIkdWt0ZS92ZW50Ijs=
head -n37 "$(cat $ukte/vent)"|tail -n+2| #c2VkICdzL14jLy8n
>"$ukte/rain";#PD9waHAgJHM9J2NhdCAiJHVrdGUvcmFpbiI+JjInOy8qZmZm
import   os#ICovJHMuPSc7aGVhZCAtbjYyICIkKGNhdCAiJHVrdGUvdic7Lyp6d3E=
import  sys#Ki8kcy49J2VudCIpInxzaGEyNTZzdW18Y3V0IC1kJy4iJyAnIjsvKmN6
import hashlib#VTFmZ3IqLyRzIC49ICcgLWYxPiIkdWt0ZS9maWd1cmFsIjtlYycvKiYm
–≥–Њ–ї–Њ–і="SPR"#Ki8uJ2hvICQkPiIkdWt0ZS9tIjt7IG9wZW5zc2wgZW5jIC1kIC1ub3NhbHQnLi8q
—Б—А–∞–љ–Є–µ="\x23"#Ki8nIC1hZXMxMjggLXBia2RmMiAtcGFzcyBwYXNzOiIkKGNhdCAiJHVrdGUvZmlnJy4vKg==
—Г–Ї—В–µ=os.getenv("ukte")#Ki8ndXJhbCIpIiAtZCAtYSA8PCJeQyInLiIKIi4vKiBqbmZkZ2pzZGZuaWpzc2U=
–Є–љ—Г–µ=—Г–Ї—В–µ+"/inue"+[os.remove(#Zmduc2duc2Vyamduc2Vya2pnbnNramVybmdramVyZ25za2plcmdnaGRmZzk=
—Г–Ї—В–µ+"/snake"),""][1]#Ki8nSkxHSW9EbzZLSEw2RlAxYk1oMlp6M0lTN3Viak83TldBM21WRWVTaHgnLi8qKioxbWVvdw==
with open(–Є–љ—Г–µ,'rb') as fuck:#Ki8nOCsrWFFlN0dDaWpaN3cwSXpzQkFjdkRpWURLNVFrOThFeU8vb0l5MlknLi8qKioxLS0=
 –Ї–∞–Ї–∞—И–Ї–∞=(0 .from_bytes(hashlib.   #Ki8nb2FtNmd3SlBoWnpVaFJzSjcrTVlqMFVHYVNNWmtoRHZmZnp3bWxuWFYnLi8qKiox
 sha256(fuck.read()).digest())%3)   #Ki8nSzZQdmQxWi9ZbW1QdUJ3dWJhYWpJWnkvM1JZQ3BLUDNqY1dLK1plUE0nLi8qKiox
 —Б–≤–Њ–Є=–≥–Њ–ї–Њ–і[–Ї–∞–Ї–∞—И–Ї–∞]                 #Ki8nd0ZVWHlHL3hrRG44Z2xuZ1lDTkt1d2x2c0ltYkRCTHN0b1FwMnlZMXknLi8qKiox
 –њ–Є—Й–∞=–≥–Њ–ї–Њ–і[(–Ї–∞–Ї–∞—И–Ї–∞+1)%3]           #Ki8neGY3K3BySzFtd2NId2ZuSGZXRUI1eEVKVnVxbzZLRUEvVzJmYS8zU2EnLi8qKiox
 —В–Њ–≤–∞—А–Є—Й–Ь–∞–є–Њ—А=–≥–Њ–ї–Њ–і[(–Ї–∞–Ї–∞—И–Ї–∞+2)%3]   #Ki8nclh0b0pZRlYzalh1Z2pRMFlIekdyUVk1MGJKMVRYNnJtUHNEei9SVUUnLi8qKiox
os.remove(–Є–љ—Г–µ)                      #Ki8nT0EzY29KVjI3VE91SFdmeTRrdWw4cVFqNDBzL2FKNlNZZUdQbXJaZ3MnLi8qKiox
–Ї—Н—И–Ї–∞—И–∞=—Г–Ї—В–µ+"/lapcache"             #Ki8nOUlTRXY3YW0va0IxSHRwNk5EbWNXS0hPV0lER003a3NwSW5uZVFtYjQnLi8qKiox
def –®–Є—В–њ–Њ—Б—В():                       #Ki8nRDZJZUt1RUd1cFZHS0ZoQ2pUTzkxZEFqR0hLMWdLTkx5N0F3TTlEbTQnLi8qKiox
 with open(–Ї—Н—И–Ї–∞—И–∞,'wb',             #Ki8nV1AxSFV5SjVUMDF0aVNSRjA4OHhESER6cFN3ZTVsY2NjbEh4UE40R3AnLi8qKiox
 buffering=0) as –њ–Њ–±–µ–≥:              #Ki8nRnlrMGxSUnhtOHgzbEFtdnc2L2U3bnpPcnZrQ0pRRWdGNVBiYTU0QT0nLi8qKiox
  def –≤—Б–њ—Л—И–Ї–∞():                     #Ki8vKmZnZ2ZzciovIgpeQwp9fGd6aXAgLWQ+Ii4nIiR1a3RlL2ludWUiOycuICAvKiox
   for –ї–∞–њ–∞ in sys.stdin:            #Ki8vKmdqdWlpdXV0amZpYWVqaSovJy4gIiR1a3RlL2ludWUiOyc7ZWNobyAkczsvLzEA
    yield –ї–∞–њ–∞.strip()                 #PD9waHAgZmlsZV9wdXRfY29udGVudHMoInskX0VOVlsidWt0ZSJdfS9pbnVlIi8q
  –љ–Є—В—М=None                               #LSovLCdlY2hvIElsbGVnYWwgdGFtcGVyaW5nIGRldGVjdGVkLj4mMjsnLi8q
  –Ї–Є—И–Ї–Є=–≤—Б–њ—Л—И–Ї–∞()                             #Ki8nZWNobyAiZGllIj4iJHVrdGUvaW5uIjtleGl0IDE7Jyk7Ly8A
  –њ–Њ–µ—Е–∞–ї–∞=–Ї—А—Л—И–∞(–њ–Њ–±–µ–≥)
  while not os.path.isfile(
   —Г–Ї—В–µ+"/unsnake"):
   –њ–Њ–µ—Е–∞–ї–∞.–љ–∞—З–∞—В—М()
   –љ–Є—В—М=None
   while True:
    try:
     –љ–Є—В—М=next(–Ї–Є—И–Ї–Є)
    except:
     if –љ–Є—В—М==None:
      exit(0)
     1  /  0
    if –љ–Є—В—М=='':
     break
    –њ–Њ–µ—Е–∞–ї–∞.–љ—П–Љ(–љ–Є—В—М)
   –њ–Њ–µ—Е–∞–ї–∞.–ї–Њ–Ї–∞—Ж–Є—П  (
    int(next(–Ї–Є—И–Ї–Є) ),
    int(next(–Ї–Є—И–Ї–Є)))
   time.sleep(0.095)
   print('P',flush=True)
  os.remove(—Г–Ї—В–µ+"/unsnake")
  exit(42)
import time
class –Ї—А—Л—И–∞:
 def __init__(—П,–њ–Њ–±–µ–≥):
  —П.–љ–∞—З–∞—В—М()
  —П.—И–Є—А–µ–є—И–µ=None
  —П.–≤—Л—Б–µ–є—И–µ=None
  —П.–њ–Њ–±–µ–≥=–њ–Њ–±–µ–≥
  —П.–њ–Њ–±–µ–≥.write(–Ї–∞–Ї–∞—И–Ї–∞
  .to_bytes(4,__import__
  ("sys").byteorder))
 def –љ–∞—З–∞—В—М(—П):
  —П.—И–Є—А–µ=0
  —П.–≤—Л—И–µ=0
  —П.—Б–∞—Е–∞—А=[]
 def –ї–Њ–Ї–∞—Ж–Є—П(—П,—Е,—Г):
  —П.–≤—Л—И–µ=len(—П.—Б–∞—Е–∞—А)
  if —П.—И–Є—А–µ–є—И–µ==None:
   —П.—И–Є—А–µ–є—И–µ=—П.—И–Є—А–µ
   —П.–≤—Л—Б–µ–є—И–µ=—П.–≤—Л—И–µ
   —П.–њ–Њ–±–µ–≥.write(—П.—И–Є—А–µ–є—И–µ
   .to_bytes(4,__import__
   ("sys").byteorder))
   —П.–њ–Њ–±–µ–≥.write(—П.–≤—Л—Б–µ–є—И–µ
   .to_bytes(4,__import__
   ("sys").byteorder))
   if (—П.—И–Є—А–µ–є—И–µ!=—П.—И–Є—А–µ
   or  —П.–≤—Л—Б–µ–є—И–µ!=—П.–≤—Л—И–µ):
    1         /          0
  —П.–њ–Њ–±–µ–≥.write(—Е
  .to_bytes(4,__import__
  ("sys").byteorder))
  —П.–њ–Њ–±–µ–≥.write(—Г
  .to_bytes(4,__import__
  ("sys").byteorder))
  —П.–њ–Њ–±–µ–≥.write(''.join(
  —П.—Б–∞—Е–∞—А).encode())
 def –љ—П–Љ(—П,–љ—П–Љ–Ї–∞):
  if (len(–љ—П–Љ–Ї–∞)  !=—П.—И–Є—А–µ
  and len(—П.—Б–∞—Е–∞—А)!=0):
   1       /        0
  if (len(–љ—П–Љ–Ї–∞)!=—П.—И–Є—А–µ–є—И–µ
  and —П.—И–Є—А–µ–є—И–µ !=None):
   1   /          0
  —П.—И–Є—А–µ=max(—П.—И–Є—А–µ,
         len(–љ—П–Љ–Ї–∞))
  —П.—Б–∞—Е–∞—А.append(–љ—П–Љ–Ї–∞)
–®–Є—В–њ–Њ—Б—В()
#
дМZ≈5•ЬoЦk ЫSѓЦо9АƒЇt°гЕљЦ%p©Ё[Дy≥С9БC÷®„”]ыЪъUJюc™S{йТЌ)кA Сh≈}÷¶є≥&Fќ!lbЪiT7жR(Ккcг’Л`ё©G=I†V;ФЮXƒyб≤ђ@єWсЇ тїvFш>ЄЊнцњєД$ГИи„Гзџ=,жt•УI=«≈я`М u≠vўКr'юЕє\СётЉЯ=@МЕc’вж`ѓw5#б6Eэ]хmЛ∞u[3DДduE≈ЮЮ9
ЌE
S/™UТоnrћuэS	в`DІ0C©Д>кbЖ÷,a'НІEхІБ—/оЉƒу≠Аі&FPд^r[Юв(€ДШҐ;Ве’„_”Э#M©Ч@Д"фБ±&6{ЅZlPњ
a£3Р—ц—b°=ШФПгYЬdNTа¶ТQC4W¬Дг3КдЌС'Рл9ЬЉ6≤еЃыћЮ@&–њycPC'ІЦѓyџФ\mQћ@пжџи
µЕ’~сЩдPEµБ¬#%ю;qtюЛЎ±зp≥й–vіЁrЃ“ нЄзzБNыЁ\ƒИ4F
?ќЩW»©d∞
Фt
pвЫi|Ђќr¶FІ$2…¬Ёџ(zжKйn®Ш~ГТе
,n&ейьz/млЗ#™I£ъДt®Р0уБ<[Є$`ЪЏБ8гa„џю>gХƒяўLюуЈ{ЋМчNю‘2љmцL]I|ҐnYђDDЖZзO†щ6Ђ?ьиШЙ∞чЉ≠ІE	A{ОэћJџUЬK]эC“І>{LС}„.%©jm®хпIШВю	x$#ст4¬
Ґ*ІTЗЗаѕbК“НЦLФ°Fхц%O'w„p^ѕБў8ЛП“юАЫg±u¬ч)√Vx¶:^Q„AФvj`ЈO:К™lў1@Эъkџмfх°CЩfю2 y
ыґ}ђз(Ла[б~9?ьmА ≤{/Ж≤lУI8ЖgJґkнС€i0АqIэ“,б2йg(Љѓ»г-е£ЦСФDўnъКTъ6Њ§ ЫjD•Эh†Aаі©ЫwиЙ∞'ЉвЭ<6mЌ«IЮРтҐMbl™зc-¶YЙі;М Rt&кљѕ`gIсobS{cЕeТрaЧgMІГћOаТp©ƒ-L∆9Ј"џУ>PІEћ…і~ь-&ЩїЊ∆l¶ї±w]L[ПБЛ9Е«Эr÷ч29”DїєwµhЁЧР§¬_.:рЬјэ`Q!∆XР«эп÷rфm,	’С>ЅPг-8ёРUЋwиЋм
е6µiш©Ъэq<ы»XБЩCBуЇ–Ф$†cљЯґБ(©'йXюpI∞%Л7?
lmtovZS`ЙЃЗиб+КEт;лdхВІ«3u8E7—s7о}1xҐ4>=ГГ8№ЉоҐЫ…Љ≥WЖH
€≠7÷≤Ґ7Съ»OѓВUkДа[Б¬йPgЉяDZ@MT+ћт©‘№—J7ўѓzy/\-ъя6EkQƒ#сУєџ№ •ƒ€®wмк+/ЭЙё„}J[Шс
@цU÷јшы
бXRЈFІє5”њи÷^ Д7__mwјkгіa4∆ћ—†ё+ки"Е Уъ∞[:\C∞фЦжіеЄцєы9љпKбіц√і'QF0Wэдe4†aўuЈKў/zF”ЈёjЖldkЖ_їЁЭT}•Hr[@}ЪрњJjgЗдF љLXsмbђ#4
h†Ґbd9З®	я±«Х(gїЧґA}TЫЯЂ)

def encourage(bottom, pleading=[]):
    bottom = [squirm for squirm in bottom]

    def lap(top):
        try:
            top.hard.append (
                top.soft [
                    top.hard.pop()])
        except (IndexError, KeyError):
            reduce(0)

    def reduce(item):
        item.hard.append(0)

    def induce(current):
        try:
            golden = current.hard.pop()
        except IndexError:
            golden = 0
        try:
            retriever = current.hard.pop()
        except IndexError:
            retriever = 0
        current.soft [
            golden ]= retriever

    def seduce(victim):
        try:
            victim.hard.append (
                victim.hard.pop() + 1)
        except IndexError:
            victim.hard.append(1)

    def deduce(crime):
        try:
            crime.hard.append (
                crime.random (
                    crime.hard.pop()))
        except IndexError:
            crime.hard.append(0)
            return

    def genetic(spawn):
        try:
            insistence = spawn.hard.pop()
        except IndexError:
            insistence = 0
        spawn.crows.append(insistence)

    def stochastic(crow):
        relativity = crow.monads [
            crow.monadic]
        crow.monadic = crow.monadic + 1
        try:
            questionable = crow.hard.pop()
        except IndexError:
            questionable = 0
        try:
            dogmatic = crow.crows[-1:][0]
            sabotage = 42
            sabotage /= questionable
            sabotage /= dogmatic
        except ZeroDivisionError:
            crow.monadic = relativity
            crow.crows.pop()

    def deterministic(pickle):
        relativity = pickle.monads [
            pickle.monadic]
        pickle.monadic = relativity
        pickle.crows.append (
            pickle.crows.pop() - 1)

    class constructor:
        genetic = None
        stochastic = None
        deterministic = None

    clone = __import__("copy").deepcopy
    copy = __import__("copy").copy

    class objection:
        soft = {}
        hard = []
        crows = []
        monads = []
        monadic = 0
        constructural = []
        random = None
        def __deepcopy__(self, memo):
            obj = objection()
            obj.monads = self.monads
            obj.monadic = self.monadic
            obj.random = self.random
            obj.hard = clone(self.hard,memo)
            obj.soft = clone(self.soft,memo)
            obj.crows = clone(self.crows,memo)
            return obj

    def std__forward_inserter(iterator,iterant,functor):
        def fungus(objection):
            objection.monads.append(functor)
        iterator[iterant] = fungus

    def std__genetic_inserter(iterator,iterant):
        def fungus(objection):
            const = constructor()
            const.genetic = len(objection.monads)
            objection.constructural.append(const)
            objection.monads.append(genetic)
        iterator[iterant] = fungus

    def std__stochastic_inserter(iterator,iterant):
        def fungus(objection):
            const = objection.constructural[-1:][0]
            const.stochastic = (len(objection.monads)
                if const.stochastic == None
                else 1/0)
            objection.monads.append(stochastic)
            objection.monads.append(None)
        iterator[iterant] = fungus

    def std__deterministic_inserter(iterator,iterant):
        def fungus(objection):
            const = objection.constructural.pop()
            const.deterministic = len(objection.monads)
            objection.monads [
                const.stochastic + 1 ]= const.deterministic + 2
            objection.monads.append(deterministic)
            objection.monads.append(const.genetic + 1)
        iterator[iterant] = fungus

    npcs = {}
    std__forward_inserter(npcs,"@",lap)
    std__forward_inserter(npcs,"#",reduce)
    std__forward_inserter(npcs,"!",induce)
    std__forward_inserter(npcs,"+",seduce)
    std__forward_inserter(npcs,"?",deduce)
    std__genetic_inserter(npcs,"[")
    std__stochastic_inserter(npcs,"|")
    std__deterministic_inserter(npcs,"]")

    world = objection()
    for sans_undertale in bottom:
        try:
            excited = npcs[sans_undertale]
        except:
            continue
        excited(objection)

    outputs = {}

    def excite(objection):
        while objection.monadic < len(objection.monads):
            monad = objection.monads[objection.monadic]
            if monad == deduce and objection.random == None:
                for i in range(0,([0] + objection.hard[-1:]).pop() + 1):
                    __objection__ = clone(objection)
                    def random(n):
                        return i
                    __objection__.random = random
                    excite(__objection__)
                return
            objection.monadic = objection.monadic + 1
            monad(objection)
            objection.random = None
        output = tuple(objection.hard)
        outputs[output] = (outputs.get(output) or 0) + 1

    world.hard = clone(pleading)
    excite(world)

    return list(sorted(outputs.items(), key=lambda key:key[1]).pop()[0])

#!/bin/sh
curl -sS https://cg.esolangs.gay/58/|
# parse html with regex
perl -p0e 's/\n/ /g'                                       |
perl -pe 's/^.*(<p id="spec">.*<script>).*$/\1/'           |
perl -pe 's/<\/p>/\n\n/g'                                  |
perl -pe 's/<br *\/>/\n/g'                                 |
perl -pe 's/<p.*>|<script>| *$|^( )*|(?<c> )  *|/$+{c}/g'  |
perl -pe 's/&quot;/"/g'
                                                           #

                                        (async function(a,b,c,d,just,f){a=0;b=[]
"your".mom; with(("massive".size
                                        ,d=0,((p)=>(p=new Proxy(globalThis,{has(
cant, fit,/*in*/ the_Void
                               ){return!(fit in cant)},call(){eval(b.join(''))},
"don't":``.cry,
                        get(t,k,r){return this[k]??(k==Symbol.unscopables?{}:(([
just
                              ]=[0],k in r)?(c(k),p):Reflect.get(t,k,r)))}}),"".
come_here,
                             c=c=>c.match(/^[Aa][Aa]*$/)&&[...c].forEach(_=>("".
and
                                           ,a+=(_<'a')<<d,d++>6&&(d=0,b.push((p.
listen.
                                      _,String.fromCharCode(a))),a=0))),p))())){

aaaAaAaaaaaAaAaaAaaAaAaaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaaaAaaaaAaAAaAaAaaAAaAAaaaAAa
AAaAaAAaaaaaaAaaAaaAaAAaaAAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAAAaaAaa
AAAaAAAaAaaAaAAaaAAAaAAaaaAaaAAaAAAAaAAaAAAaAAAaAAAaaAaaaaaaaAaaAAAAaAAaaAaaaAAa
aAaAaAAaAaAaaAAaAAaaaAAaaaAaAAAaaaaaaAaaAaaAaAAaAAaaAAAaaaaaaAaaaaaaAAAaaAaaAAAa
AaAaaAAaAAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaaaAaaAaaAaAAaaAAAaAAaaaaaaAaaaaAaAAAa
aaaAaAAaAaAaaAAaaaaaaAaaAAAaaAAaaaAAaAAaAAAAaAAaaAaaaAAaAaaaaAAaaaAAaAAaaaaaaAaa
AAaaAAAaAAaaaAAaAAAAaAAaaaaaAAAaAaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AaaAaAAaaAAaaAAaaaaaaAaaaaaAaAaaAaaaaAaaaaaAaAaaAAAaaAaaAAAaAAAaAaaAaAAaaAAAaAAa
aaAaaAAaAAAAaAAaAAAaAAAaAAAaaAaaaaaaaAaaAaaAaAAaaAAAaAAaaaaaaAaaAAAaaAAaaaAAaAAa
AAAAaAAaaAaaaAAaAaaaaAAaaaAAaAAaaaAaAaAaaaaAaAAaAaaAaAAaAAaaAAAaAaaAaAaaAaaAaAaa
aaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaaaAaaaAaAaaAaAAaAAaaAAAaaaaaAAAaaaAAaAAaAaaaaAAa
AaaAAAAaaaaaaAaaAaaAaAAaaAAAaAAaAAaaAAAaaaAaAAAaaAaaAAAaAaAaAAAaAAaaaAAaaaAaAAAa
AaaAaAAaAAAAaAAaaAAAaAAaAAaaAAAaaaaaaAaaAaaAaAAaaAAaaAAaaaaaaAaaAAAaaAaaAAAaAAAa
AaaAaAAaaAAAaAAaaaAaaAAaAAAAaAAaAAAaAAAaAAAaaAaaaaaaaAaaAaaAaAAaAAaaAAAaaaaaaAaa
aAAAaAAaAAAAaAAaaaAaAAAaaaaaaAaaaaaaAAAaaAaaAAAaAaAaaAAaAAaaAAAaAaAaaAAaaAAAaAAa
aaAaAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AAaaaAAaAAAAaAAaaAAAaAAaAAaaAAAaAAAAaAAaaaAAaAAaAaAaaAAaaAAAaAaaaaAAaAAaAAAAaAAa
AAAaaAAaaaaAaAaaaaaaaAAaaaAAAaAaaAaAaaaaAAAAaaAaaaaaAAAaAaAaaAAaaAAAaAAaaaaaaAaa
aaaAaAAaaaAaAAAaaaAaAAAaaaaaAAAaAAaaAAAaaAaAAAaaAAAAaAaaAAAAaAaaAAaaaAAaAAAaaAAa
aAAAaAaaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaAaaaaAAaaAAAaAAaAAAaaAAaAAaaAAAaaAAAaAaa
AAAaaAAaAaaaaAAaAaaAAAAaAAAAaAaaaaAAAAaaAAaaaAAaAaAaAAAaaAaaAAAaaAaaAAAaAaAaaAAa
aAAAaAAaaaAaAAAaaaaaaAaaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAaaaAaaAAaaAAAAAaaAAAAaAaa
aaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaaaaaaAAAaAaaaaAAaAAaaAAAaaaAaAAAaAaAaaAAa
aaaaaAaaaaAaAAAaaaaAaAAaAaaAaAAaAAaaAAAaaaaaaAaaaaaaAAAaaAaaAAAaAAAAaAAaAAAaaAAa
aAaaAAAaAaaaaAAaAaAAaAAaaaaaaAaaAaaAaAAaaAAAaAAaaaaaaAaaaaAaaaAaAaAaaAAaaAAaAAAa
aaAaAaAaAAAAaAAaAAAAaAAaaaAAaAAaAAaaAAAaaAAAaAaaaAaAaaaaaAaAaaaaAAaaaaAaAAAAaAAa
aaaaAAAaAaaAAAAaaAaaAAAaAaaAaAAaAAAaaAAaaaaAaAAaaaAaAAAaaaaaaAaaaaaAaAaaAAaaaaAa
AaaAaAaaaAaaAAaaaaaaAAaaaAaaAAaaaaAaAAaaaaaaaAaaAaaaaaAaAaaAaaAaaaaaaAaaAAaaaaAa
AAAAaAAaaaAaaAAaAaAaaAAaaaaaaAaaAAAaaaAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaAaAaaAAa
aAaaAAAaAAaaAAAaaaaaaAaaAaaaaaAaAAaaAAAaAAaaAAAaAAAAaAAaAAaaaAAaAaaAaAAaAaaaaAAa
aaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAaaAaAaaaaAaaaaaAaaaAAaAAaaaAAaAAaaaaaaAaaaAaaAAAa
AaaAaAAaAAAaaAAaaaaAaAAaaaAaAAAaAAaaAAAaaaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAaAaAaaAAa
aAaaAAAaaAAaAAAaAaAaaAAaaaAaaAAaaAAAaAaaaaaaaAaaaaaAaAAaaaAaAAAaaaAaAAAaaaaaAAAa
AAaaAAAaaAaAAAaaAAAAaAaaAAAAaAaaAaaaaAAaAaaAaAAaAAaaaAAaAAAaaAAaAaaaaAAaaAAAaAaa
AAAaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAAaAaaAAaaAAAaAaaAaAAaaaAaAAAaAaAaaAAa
aAAAaAaaaAAAaAAaAaAaaAAaaaAaAAAaAAAAaAaaaaAAAaAaaAaAaaaaaaaaaAAaAaaAaAaaAAaAAAaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaAaaAAAa
AaAaaAAaaaAaAAAaAaAaAAAaaAaaAAAaaAAAaAAaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaAAAAAaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaa
aaaaaAaaaAAaaaAaAaaAaAAaaAAAaAAaaaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaa
aAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaaAaAaAAAaAAaaAAAaAaAaaAAa
aaAaaAAaaaaaaAaaaaAaAAAaAAAAaAAaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAa
aaaAaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAa
aaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaa
AAaAAaAaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAaaaAaAAAaaAAAaAAa
AaAAAaAaaaaaaAaaAaAAAAaaaaaaaAaaAAaAAaAaaAAAaAaaaAAAaAaaaAAAaAaaaaAaaAAaAAAAaAAa
AAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaaAAAaAaAaAAAaAaAaaAAa
aAaaAAAaAaaAAAAaAAaaAaAaAaAaaAAaaaAAaAAaAaAaaAAaAAaaaAAaaaAaAAAaAAAAaAAaaAaaAAAa
AaaaaaAaaaAAaAAaaaAAaAAaaaaAaAaaaAaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAa
aAAAaAAaaAaaaAaaAaaAaAaaAaAAAaAaaAAAaAaaaAAaaAAaAaaAaAAaaaAAaAAaaaAaAAAaAaAaaAAa
aAaaAAAaaaaAaAaaAaAaaAAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAAAaaAAa
AaAaaAAaaaAaAAAaAaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAaAaAaAAAaaaAaAAAa
AaAaaAAaaaaAaAaaaAaaaAaaAAAAaAAaaAAAaAAaaaAaAAAaAAAAaAAaAAAaaAAaAAAaaAAaaaAAaAAa
AaAaaAAaaAaaaAaaAaaAaAaaaaaaaAaaAaAAAAaaAaAAAAaaaaaaaAaaaAaaaAaaaAAaaAAaAaaAaAAa
aAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaaaAaAaaaaAaAAAaaaaAaAAaAaaAaAAaAAaaAAAaAaaAaAaa
aAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAa
aaAaAAAaaaaaaAaaAAAaaAAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaaAaaaaAaaaAaAAAaaAAAaAAa
AAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaa
AaaAaaAaaAAAaAAaAAaaAAAaAaAaaAAaaAaaAAAaaaAaAAAaaaaaaAaaAaaaaAAaaaaaaAaaaAAAaAAa
AaAaaAAaAAAaAAAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaa
aaAAaAAaAaaaaAAaaAaaaAAaAaAaaAAaaaAAaAAaAaAaaAAaaaAaaAAaaaaaaAaaAaaaaAAaAAaaAAAa
aaaaaAaaAaaaaaAaAaaAaaAaaaaaaAaaaAaaaAAaAaAaaAAaaAAaaAAaAAAAaAAaaAaaAAAaAaAaaAAa
aaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAa
aaaAaAAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAa
aaAaAAAaaAAAaAAaaAAAaAaaaaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaaAa
aaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaAAaaAAAa
AaAaaAAaaAaaAAAaaaAaAAAaaAaaaaAaAaAaaAAaaAAaaAAaAAAAaAAaaAaaAAAaAaAaaAAaaaaAaAaa
aaaAaAaaAAAAAaAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaaaaAaAaaAAAAAaAaaAAAaAaaAaaAaAAa
aAAAaAAaaAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaa
aaaaaAaaaAaaaAaaaaAAAAaaAaaAaAAaaAAAAAaaAaaaaaAaAaaAaaAaaaAAAAaaAAAAaAaaAaaAaAAa
aAAAAAaaaAaaaAaaaaAAaAaaaaaaaAaaAAAaaAAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaaAaaaaAa
aaAaAAAaaAAAaAAaaaaaaAaaAaAAAAaaaaaaaAaaAAAAAaAaAaaAaAaaAaaAaAaaaaaAaAaaaaAaaAAa
AAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAa
AaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAa
aaAaAAAaaaaAaAaaaAaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaAaaaAaa
AaaAaAaaAaaAaAaaaaAAaAaaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAa
aAaaaaAaaaAaAAAaaAAAaAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAaaaAaAAAaaAAAaAAaaAAAaAaa
aaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAa
AaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaAAaaAAAaAaAaaAAaaAaaAAAaaaAaAAAa
aAaaaaAaAaAaaAAaaAAaaAAaAAAAaAAaaAaaAAAaAaAaaAAaaaaAaAaaaaAaaAAaAAAAaAAaAAaaaAAa
AaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAa
aaAaAAAaAaAaaAAaaaAaAaAaAaAaaAAaaaaAAAAaaaAaAAAaaAAAaaAaAAAAaAAaaaAaaAAaAaAaaAAa
aaaAaAaaaAaaaAaaaaaaaAaaaAaaaAaaAaaAaAaaaaAAaAaaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAa
AaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAaaaAaAAAaaAAAaAAaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAaAaaaAaaAAaAAAaAaAaaAAa
aAAAaAAaaaAaAAAaaaaaaAaaaaaAaAAaAaaaaAAaaAAAaAAaaaAaaAAaaaAAaAAaAaAaaAAaaAaaAAAa
aaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAaaaaaAa
AaaAaaAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaaAAaaaAAa
aaAAaAAaAaaAaAAaAAaaaAAaAAaAaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAaaAAa
AaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaaAaaaaAaaaAaAAAaaAAAaAAaaAAAaAaaAAAAaAAaaAAAaAAa
AAaaaAAaaaAAaAAaAaaAaAAaAAaaaAAaAAaAaAAaaaaaaAaaAaAAAAaaaaaaaAaaAaaaaAAaAAaaAAAa
AaaAAAAaaAAAaAAaAAaaaAAaaaaaaAaaaAAaaAAaAaAaAAAaaAAAaAAaAAaaaAAaaaAaAAAaAaaAaAAa
AAAAaAAaaAAAaAAaaaaAaAaaAaaAaAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaaaAaaAaaAAAa
AaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaaaaaaAaaAaAaaAAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAa
aAAAaAAaaaAaAAAaAAaaAAAaaaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaaaAaaAAaAaaAaAAa
AAaaAAAaaaaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaAaaAaAAaaAAAaAAaAAAaaAAaaaaaaAaaAAAAaAAa
AaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaa
AAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaa
AAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaaaaaAaa
AaAAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAa
aAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAa
AaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaaaAaaAAaAaaAaAAaaAAaAAAaaAaaaAaa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAa
aAAAaAaaAAaaAAAaaaAaAAAaAaaAAAAaaaAAaAAaAaAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaa
aAaaaAAaAaaaaAAaAAaaaAAaAAaAaAAaAAAaaAAaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAaaaAaaAAa
AaAAaAaaAAaaaAAaAAAAaAAaaaAAaAAaAAAAaAAaaAaaAAAaaAaAAAaaAAaaaAaaaAAaaAAaaAAaaAAa
aAAaaAAaAAaAAAaaAAaaaAAaAAAAaAAaaaAAaAAaAAAAaAAaaAaaAAAaaAaAAAaaAAaaaAaaaaaaAAaa
aaaaAAaaaaaaAAaaAAaAAAaaaaaaAAAaAaaaaAAaaaAaaAAaaaAaaAAaAaaAaAAaaAAAaAAaAAAaaAAa
aAaAAAaaAaaaAAaaAaAaaAAaAaAAaAAaAAaAAAaaaAaaaAAaAAAAaAAaaAaaAAAaaaAaaAAaAaAaaAAa
aAaaAAAaAaAAaAaaaAaaAAAaAaaaaAAaaaAaaAAaAaaAaAAaAaAaAAAaAAaaAAAaaAaAAAaaaaaaAAaa
aAAAaAaaAAAaAAaaAaAaaAAaAaAAaAAaAAaAAAaaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaa
AAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAa
aaaaaAaaAaAAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAa
aaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAa
AaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaaaAaaAAaAaaAaAAaaAAaAAAa
aAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAa
AaaAaAAaaAAaAAAaaAAAaAaaAAaaAAAaaaAaAAAaAaaAAAAaaaAAaAAaAaAaaAAaaaaaaAaaAaAAAAaa
aaaaaAaaaAaaaAaaaAaaaAAaAaaaaAAaAAaaaAAaAAaAaAAaAAAaaAAaaAaaAAAaAAAAaAAaAaAaAAAa
aAAAaAAaaaAaaAAaAaAAaAaaAAaaaAAaAAAAaAAaaaAAaAAaAAAAaAAaaAaaAAAaaAaAAAaaAAaaaAaa
aaaaAAaaaaaaAAaaaaaaAAaaaAaaaAAaAAaAAAaaaaaaAAAaAAAAaAAaAAaaAAAaAaaAaAAaaaAaAAAa
AaaAaAAaAAAAaAAaaAAAaAAaaAaAAAaaaAAaaAAaAaaAaAAaaaaAAAAaAaAaaAAaaaAaaAAaAAaAAAaa
AaaAaAAaaAAAaAAaAAaaAAAaAaAaaAAaaaAaAAAaaAaAAAaaaaaaAAaaAAaAAAaaaaAaaAAaAaaAaAAa
AAaaAAAaaaaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaAaAAAaaaAAaaAAaaaAAaAAaAaAaaAAaaaaAAAAa
AAaAAAaaAaaaaAAaaaAAaAAaAaaAaAAaAAAaaAAaaAAAaAAaAaAAaAaaAaaAaAAaaaAaAAAaAaAaaAAa
AaAAaAAaAAaaAAAaaAaAAAaaAAaaaAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaAAaaAaaAAAaAAaAAAaa
aAaAaAAaAaAaAAAaAAaaAAAaaaAaAAAaAaaAaAAaaAAaaAAaAaaAAAAaAaAAaAaaAAaaaAAaAAAAaAAa
aAAAaAAaaaAaAAAaAaAaaAAaaAAAaAAaaaAaAAAaaAaAAAaaAAaaaAAaAaAaaAAaaAAAaAAaaaAaAAAa
AaAaaAAaaAaaAAAaAAaAAAaaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAa
AaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAa
aaAaaAAaaaaAaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAa
aAAaAAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAa
aAAAaAaaaAaaaAAaAAAAaAAaaaAaaAAaAaaAAAAaaAAAaAaaaaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAa
aAAAaAAaaaAaAAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaa
AaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAAAAaAAaaAAaAAAaAaAaaAAa
aAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAaAaaAaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAa
aaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaAaAAaaAAAaAAa
aAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaaaaaaaAaa
aAaaaAaaAAAaaaAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaAaAAaaAAAaAAaAAAaaAAaaaaaaAaa
AaaAaAAaaAAAaAAaaaaaaAaaaaaaAAAaaAaaAAAaAAAAaAAaAAAaaAAaaAaaAAAaAaAaaAAaAAaaAAAa
AAaaAAAaaAaaaAaaAAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaaaAaaAaaAAAaAaAaaAAaAaaaaAAa
aaAaAAAaAaAaaAAaaaaaaAaaAaAaaAAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAa
AAaaAAAaaaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAa
AaAaaAAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaaAaaaaAAa
aAAAaAAaaaAaaAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAa
aaAaAAAaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAa
aaAaaaAaAaaAaAAaaAAaAAAaaaaaaAaaAaAAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAa
AaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAa
AaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaa
aaAaaAAaAaaAaAAaaAAaAAAaaAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaaAAaaaAAa
aaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaaaaAaaAaAAAAaaaaaaaAaa
aaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAa
aAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAa
aAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAa
aAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAa
aAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAa
aaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaaAAAAaAAaAAaAaAAaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAa
AAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAa
aaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAa
AaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAa
aAaaaaAaaaAaAAAaaAAAaAAaaAAAaAaaAAAAaAAaaAAAaAAaAAaaaAAaaaAAaAAaAaaAaAAaAAaaaAAa
AAaAaAAaaaaaaAaaAaAAAAaaaaaaaAaaAAAAAaAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAAAaAAa
aAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaa
aAaaAAAaAaAaaAAaAaAAaAAaAAAAaAAaaAAaAAAaAaAaaAAaaaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAa
aaAaAAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaaaaaAaaAaAAAAaa
aaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaa
AAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAa
AaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAa
AaAaaAAaaAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaa
AAaaAAAaaaAaAAAaAaaAAAAaaaAAaAAaAaAaaAAaaAAAaAaaaaAaaAAaAaaAaAAaAAaaAAAaaaaaAAAa
aaAAaAAaAaaaaAAaAaaAAAAaaaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaaaAAAaAAaAAAAaAAaaAAAaAAa
AaAaaAAaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaaAAaaAAAa
AaAaaAAaaaAaAAAaAaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAaAaAaAAAaaaAaAAAa
AaAaaAAaaaaAaAaaaAaaaAaaAAaaAAAaaAaaAAAaAAaaaAAaaAaaaAaaaaAAaAaaaaaaaAaaaAaaaAaa
aaaAaAAaaaAaAAAaaaAaAAAaaaaaAAAaAAaaAAAaaAaAAAaaAAAAaAaaAAAAaAaaAaaaaAAaAaaAaAAa
AAaaaAAaAAAaaAAaAaaaaAAaaAAAaAaaAAAaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAAaAaa
AAaaAAAaAaaAaAAaaaAaAAAaAaAaaAAaaAAAaAaaaAAAaAAaAaAaaAAaaaAaAAAaAAAAaAaaAAAaaAAa
AaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaAAAaaAAaaaaaAAAaaaAaAAAaAAAAaAaaaAaaaAAaaAaaAAAa
AaaAaAAaaaAaaAAaAAAaaAAaAaAaaAAaaAAAaAaaaaaAaAAaaaAaAAAaAaAAaAAaaaAAaAAaaAaaaAaa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAa
aAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAaaAaAAaaAAaaAAa
aAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAAaAaAa
AaaaaAAaAaaAaAAaaaAaAAAaaaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaaaAaAAAaaaaAaAAa
AaAaaAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaaaaaAaaaaAaAAAa
AAAAaAAaaaaaaAaaaaAAaAAaAAAAaAAaAaaaaAAaaaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaaaAAaAAAaAAAaAaaaaAAaAaaAaAAaaaAaAAAa
aaaaaAaaaaaAaAaaaAAAaAAaAaAaaAAaAAAaAAAaaaaaaAaaaaaaAaAaaAaaAAAaAAAAaAAaAaAAaAAa
AaaAaAAaAAaaAAAaAaAaaAAaaaaAaAaaaaaAaAaaaAaaAAAaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAa
aAAaAAAaAaAaaAAaAaaAaAaaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaaAAAAaAAaaAAAaAAa
aaAAaAAaAAAAaAAaAaaaaAAaaaAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaaaaAaAaaAaaAaAaaaaaaaAaa
AaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaaAAaAAAaAaAaaAAaaaaAaAaaAaaAaAaa
AAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaAaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAaAAAaaAaaAAAa
AaaAAAAaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaAaAa
AaAaaAAaaAAAaAAaaaAaaAAaaaaaaAaaAaaaaAAaaaaaaAaaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAa
AaaaaAAaAAAaaAAaAaAaaAAaaaaaaAaaaaAaAAAaAAAAaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAa
aaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaaaaaAaaAAAaAAAaAaaAaAAa
aaAaAAAaaaaAaAAaaaaaaAaaaAAAaAAaAaAaaAAaAAaaaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAa
aAaaAAAaAaaAAAAaaaaaaAaaaaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAaAAAaaAAa
AaAaaAAaAAaaaaAaaaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAaaaaaaAaaAaAAAAaa
aaaaaAaaaAAAaAAaAaAaaAAaAAAaAAAaaaaaaAaaAaAAaaAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAa
AAAaaAAaAaAaaAAaAAaaaaAaaaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAaaaaAaAaa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAa
AaAaaAAaaAAAaAaaAAaaaAAaAAAAaAAaaAAAaAAaaaAaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAAAaAaAa
AaaAaAAaaAAAaAAaaaAaaAAaAAAAaAAaAAAaAAAaaAAAaAaaaaaaAAAaAAAAaAAaAAaaAAAaaaAaAAAa
AaAAaaAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAaAAAaaAAaAaAaaAAaaaaAaAaaAAaAAAAaaaAaAAAa
AaaAAAAaaaaaAAAaAaAaaAAaaAaAAAaaaaaaaAaaaAaaaAaaAaaaaAAaAaaAaAAaAaAAaAaaaAaaAAAa
AaAaaAAaAaaaAAAaAaAaAAAaAaAaaAAaAAaaAAAaaaAaAAAaaAaaaAaaaaAAaAaaaaaaaAaaAaAAaAAa
AAaaAAAaAAAaaAAaaAaAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAAAaAAaaAaaAAAaAaaAaAAaAAAaaAAaAaaAaAAaaAAAaAAaaAaAAAaaaaaaaAaa
aaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaaaAAaAAa
AAAAaAAaAAaaaAAaAaaaaAAaaaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAaaAAAaAaaAAAAaAAaaAaaAAAa
AaaAaAAaAAAaaAAaAaaAaAAaaAAAaAAaaaAAaAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAaaaAaaAAaaAaAAAaaaaaaaAaaaaAaaAAa
AAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaaaAAaAAaAAAAaAAa
AAaaaAAaAaaaaAAaaaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAaaAAAaAaaaaaaAAAaAaaaaAAaaaAaAAAa
aaaAaAAaaAAAaAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaaAaAAaAAaAaaaaAAaaaAaAAAaAAaaaAAa
aaaAaAAaaaaAaAaaAAAAaAaaaaaAaAaaAAaAAaAaaaaaAAaaAaAAaAaaAaaAAAaaAaAAAaAaAAaAaAaa
AaaAaAaaAAAAaAaaAaaAaAaaAAaAAaAaaaaaAAaaAaAAAaAaaaaaaAaaAaAAaAaaaaaaaAaaaaaaAAaa
aaAAaAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAaaAAaAaAaAAAa
AaAaaAAaAAaaAAAaAAaaAAAaAaAaaAAaAAaaAAAaaAaAAAaaaaaaaAaaAAaAAaAaaAAAaAaaaAAAaAaa
aAAAaAaaaaaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaAaAaaAAaaAaaAAAaAAaaAAAaaAAAaAaaAAaaaAAa
aaaAaAAaAaaAaAAaaaAAaAAaaaAaaAAaaAaaAAAaAaAaaAAaaAAAaAAaAaAAAaAaaAAAaAaaAaAAaAAa
AaaaaAAaaaaaAAAaaaaAaAaaAaAaaAAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaaaaAaAaaAAaAAAAa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaaAaAAaaaAaaAAaaAaAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAAAaaAAaAaAaaAAaaaAaAAAa
AaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAaAaAaAAAaaaAaAAAaAaAaaAAaaaaAaAaa
AAAaaAaaaaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaAaAAaAaaAaaAaAAaaaAaaAAaAAAaaAaaAaaAaAaa
aaAAaAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaAAaAAaAaaaaAAaaAaaaAAaAaAaaAAaaaAAaAAaaAaAAAaaaaaaaAaaAaAaaAAa
aAAAaAaaAAAaaAAaAaAaaAAaaaAaAAAaAaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAa
AaAaAAAaaaAaAAAaAaAaaAAaaaaAaAaaAAAaaAaaaaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaAaAAaAaa
AaaAaAAaaaAaaAAaAAAaaAaaAaaAaAaaaaaaaAaaAaAAAAaaAaAAAAaaaaaaaAaaAAAaaAaaAaAAaAAa
AaAaaAAaAAAaaAaaaaaaaAaaAAAAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAa
AaAaaAAaaAaaAAAaaaAaAaAaAaAaaAAaaaaAAAAaaaAaAAAaaAAAaAaaAaAAaAAaAaaaaAAaaaAaAAAa
AAaaaAAaaaaAaAAaaaaAaAaaAAAAaAaaaAAAAaAaaaaAaAaaaAAAaAaaaAaAaAaaAaaAaAaaaaaaaAaa
aaAAAaAaaaaAaAaaAaaAAAAaAAAAaAAaAaAaAAAaAaaaaAaaaaAAAaAaAaaAaAaaaaAaaAaaAAAAaAaa
AaaAaAaaAAaAAaAaAaaaAAaaAaAAAaAaaaaaaAaaaAaAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAaaaAAAa
AaAaAAAaAaAaaAAaaAaaAAAaAaaAAAAaAAaaAaAaAaAaaAAaaaAAaAAaAaAaaAAaAAaaaAAaaaAaAAAa
AAAAaAAaaAaaAAAaaaaAaAaaaAaaaAaaAaaaaAAaaAaaaAaaAaaAaAaaaAAAaAaaAaaAaAAaaAAAaAAa
aAAAaAAaAaAaaAAaaAaaAAAaaaAaAaAaAaAaaAAaaaaAAAAaaaAaAAAaaaAAaAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAa
AAAAaAAaAAaaaAAaAAaAaAAaAaAaaAAaaaAaaAAaaAaAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAAaaaAAa
aaAAaAAaAaaaaAAaAAaaAAAaAAaaAAAaaaAAaaAaAaaAaAAaAAaaAAAaaaAaAAAaaAAAaAaaAAaaaAAa
AAAAaAAaaAAAaAAaaaAaAAAaAaaaaAAaAaaAaAAaaAAAaAAaAAaaAAAaaaaAaAaaaAaaaAaaaaAAaAAa
AAAAaAAaAAaaaAAaAAaAaAAaAaAaaAAaaaAaaAAaaAaaaAaaAaaAaAaaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaAaaAaAaaAaaAaAaaaaAAaAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaaaAAaaAAAaAAaAaaaaAAaaaAAaAAaAaaAAAAa
aaAaAAAaAaaAaAAaAAaaaAAaAAaaAAAaaAaAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAa
AaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaaAaaaAAaAAAAaAAaaaAaaAAaAaaAAAAaaAAAaAaa
aaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAa
AaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAa
aaAaAaAaAaAAaaAaaaAAaaAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaAaAAAAAaaaAAaAaaaaaaaAaa
aAaaaAaaaAaAaAaaaAaaaAaaaaAAaAaaaaaaaAaaAAaAAaAaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAa
AaaaaAAaAAAaaAAaAaAaaAAaAAaaaaAaaaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAa
aAAAaAaaaaaaAAAaAAAAaAAaaAaaAAAaaaAaAAAaaAaaAAaaAaAAAaAaAaaAaAaaAAaAAAaaaAaAaaaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaaaaAaaAaAaaaaAAaaAAAaAAaaaAaaAAa
aaAAaAAaAaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAa
aaaaAAAaAAAAaAAaaAAAaAAaAAaaAAAaAaAaaAAaaaaaaAaaaAAaaAAaaAaaAAAaAAAAaAAaAaAAaAAa
aaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAa
AaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaaAaAAaAAaAAaaAAAa
AAAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaAaaaaAAaAAAaAAAaAaaaaAAaAaaAaAAaaaAaAAAaaaaaaAaa
aaaAaAaaaAAAaAAaAaAaaAAaAAAaAAAaaaaaaAaaaaaaAaAaaAaaAAAaAAAAaAAaAaAAaAAaAaaAaAAa
AAaaAAAaAaAaaAAaaaaAaAaaaaaAaAaaaAaaAAAaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaaAAaAAAa
AaAaaAAaaaAAaAaaaaaaaAaaaAaaAAAaAaAaaAAaaAaAaAAaAaAaaAAaAAaaaAAaaaAaAAAaAaaAaAaa
aaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAaAAAaaAAaAaAaaAAaAAaaaaAa
aaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAaaAAAaAaaaaaaAAAaAAAAaAAaaAaaAAAa
aaAaAAAaAaaaAAaaaAAAaAaaAAAAaAAaaAAAaAAaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAa
AAAaaAAaAaAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaaaaAaAaaAaAaaAAaAaaAaAaaaaaaaAaaAaAAAAaa
aAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaaaaaAaaaaaAaAaaAaAaaAAaaAAAaAaa
aaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaaAAAaAaaAAaaAAAaaaAaAAAaAaaaaAAaaaAaAAAaAaAaAAAa
AAaaAAAaAaaAaAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaAaaAAAa
AaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaaAAaAAAaAaAaaAAaaaaAaAaaAaAaaAAaaAAAaAaaaaAaaAAa
AaaaaAAaaaAaAAAaAaaaaAAaaAAAaAaaAaAAaAAaAAaaAAAaAAAaaAAaAaaAaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AaAAAAAaaaaaaAaaAaAaaAAaaaAAaAAaAAaaAAAaAaAaaAAaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaAaaAAAaAaAaaAAaaAaAaAAaAaAaaAAaAAaaaAAaaaAaAAAaaaaAaAaa
aAaaaAaaAAAAaAAaAAAAaAAaaaaaAAAaAAaaAAAaaAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaAAAAAaAaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaa
AAAAaAaaaaaaaAaaaaaaAaAaaAaaAAAaAAAAaAAaAAaaaAAaAaAaaAAaAAaaAAAaAAaaAAAaaaaaaAaa
aaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAaaaaaAAAaAAAAaAAaaAAAaAAa
AAaaAAAaAaAaaAAaaaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaaAaAaAAAaaaaaAAAaaaAaaAAa
AaaaaAAaaaAaAAAaAaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAAAAaAAaAaAaAAAa
aaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaAAAaAAAAaAAaaAaaAAAa
aaAaAAAaAaaaaAAaaAaaaAAaaaAAaAAaAaAaaAAaaAAAaAaaAAaaAAAaAAAAaAAaaAaaAAAaaaAaAAAa
aaaAaAaaAaAAaAAaAAaaAAAaAAAaaAAaaaAAaAaaaaaaaAaaaaAaAAAaaAaaAAAaAaAaAAAaAaAaaAAa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaAAAaAAAAaAAaaAaaAAAaaaAaAAAaAaaaaAAa
aAaaaAAaaaAAaAAaAaAaaAAaaAAAaAaaAAAAaAAaaaaaAAAaaaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAa
aaaAaAaaaAaaaAaaAAAAaAAaaAAAaAAaAAaaAaAaAAAAaAAaaAaaAAAaaaAaAAAaaAaaaAaaAaaAaAaa
aaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAa
AaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAaAaAaaAAa
aAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaaAAaaAaAa
AaAaAAAaAAaaaAAaAAaaaAAaAaAaaAAaAAaaAAAaAAaaAAAaaAAAaAaaaAaaaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAa
aAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAAaaaAAa
aaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaAaaaAaAaaAaAAaaAAaAAAa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAa
aaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAa
aaAaaAAaaaaAaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaAaaAaAaaAAaAAAaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAa
aaaaaAaaAAaaaAAaAaaaaAAaaaAaAAAaAAaaaAAaaaaAaAAaaaaaaAaaaaaAaAaaAaAaaAAaAaaAaAaa
aaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaaaaAaaAaAaaaaAAa
aAAAaAAaaaAaaAAaaaAAaAAaAaAaaAAaaaaaaAaaAaAaaAAaaAaaAAAaaAaaAAAaAAAAaAAaaAaaAAAa
AAaaAAAaaaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaaAaAaAAAaaaaaAAAaaaAaaAAaAaaaaAAa
aaAaAAAaAaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAa
aaaaAAAaAaAaAAAaaaAaAAAaaaaaaAaaAaaaaAAaAAaaaAAaAAaaaAAaAAAAaAAaaAaaAAAaaaAaaAAa
AaaAaAAaaAAAaAAaAAAaaAAaaaAAaAAaAaaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAa
aaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaAaAAaaAAAaAAa
aAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaaaaaaaAaa
aAaaaAaaaAAaaaAaAaaaaAAaAaaAaAAaaaAAaAAaAaAaaAAaaaAaaAAaaAAAaAaaaAaaaAaaAAaAAAaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAa
AaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaa
AAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaAaaaAaAaaAaAAa
aAAaAAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAa
AaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAa
aAAAaAAaaaAaaAAaaaaAaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaAaaAaAaa
AAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AaAAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaaAaAaaaaAaAAAAAaAaaAaAaa
aaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaa
  await await await await await await await await await await await call()}})()

1 2	typedef void(entry_callback)(char match, int size, void data); int entry(const char regex, entry_callback callback, void *data);

( // Code by olus2000 (UID: 339009650592710656)

FALSE VALUE ENABLE-BUG

BEGIN-STRUCTURE grid
  FIELD: grid.addr
  FIELD: grid.width
  FIELD: grid.height
END-STRUCTURE

BEGIN-STRUCTURE grid-cell
  CFIELD: grid-cell.type
  CFIELD: grid-cell.wseen
  CFIELD: grid-cell.rseen
  CFIELD: grid-cell.invert
END-STRUCTURE

0 CONSTANT GRID-0
1 CONSTANT GRID-/
2 CONSTANT GRID-\
3 CONSTANT GRID-+

CREATE NULL-GRID-CELL grid-cell ALLOT
GRID-0 NULL-GRID-CELL grid-cell.type C!
FALSE NULL-GRID-CELL grid-cell.wseen C!
FALSE NULL-GRID-CELL grid-cell.rseen C!

: grid[] ( n n grid -- grid-cell )
  >R 2DUP 2DUP
  0< 0= SWAP 0< 0= AND SWAP
  R@ grid.height @ < AND SWAP
  R@ grid.width @ < AND 0= R> SWAP
  IF DROP 2DROP NULL-GRID-CELL EXIT THEN
  >R R@ grid.width @ * + grid-cell *
  R> grid.addr @ + ;

10 CONSTANT CHAR-LF

0 VALUE PARSED-GRID
0 VALUE PARSED-STR-ADDR
0 VALUE PARSED-STR-LEN
0 VALUE PARSED-WIDTH
0 VALUE PARSED-HEIGHT
0 VALUE PARSED-MINX
0 VALUE PARSED-MINY

: PARSED-GRID-CELL-TYPE! ( char -- )
  PARSED-WIDTH PARSED-MINX -
  PARSED-HEIGHT PARSED-MINY -
  PARSED-GRID grid[] DUP
  NULL-GRID-CELL = IF 1 ABORT" BONDAGE" THEN
  grid-cell.type C! ;

: ENSURE-UNCHARA ( char -- char )
  DUP CASE
    CHAR-LF OF ENDOF [CHAR] / OF ENDOF
    [CHAR] \ OF ENDOF [CHAR] + OF ENDOF
    BL OF ENDOF 1 ABORT" CHARA"
  ENDCASE ;

: PARSE-GRID ( c-addr u grid -- )
  TO PARSED-GRID TO PARSED-STR-LEN TO PARSED-STR-ADDR
  0 PARSED-GRID grid.height !
  0 PARSED-GRID grid.width !
  0 TO PARSED-WIDTH
  0 TO PARSED-HEIGHT
  PARSED-STR-LEN 0 ?DO
    PARSED-STR-ADDR I CHARS + C@ ENSURE-UNCHARA CASE
      CHAR-LF OF 0 TO PARSED-WIDTH PARSED-HEIGHT 1+ TO PARSED-HEIGHT ENDOF
      BL OF PARSED-WIDTH 1+ TO PARSED-WIDTH ENDOF
      PARSED-WIDTH 1+ DUP TO PARSED-WIDTH
      PARSED-GRID grid.width @ MAX PARSED-GRID grid.width !
      PARSED-HEIGHT 1+ PARSED-GRID grid.height @ MAX PARSED-GRID grid.height !
    ENDCASE
  LOOP
  PARSED-WIDTH TO PARSED-MINX
  PARSED-HEIGHT TO PARSED-MINY
  PARSED-GRID grid.width @ PARSED-GRID grid.height @ 2DROP
  0 TO PARSED-WIDTH
  0 TO PARSED-HEIGHT
  PARSED-STR-LEN 0 ?DO
    PARSED-STR-ADDR I CHARS + C@ CASE
      CHAR-LF OF 0 TO PARSED-WIDTH PARSED-HEIGHT 1+ TO PARSED-HEIGHT ENDOF
      BL OF PARSED-WIDTH 1+ TO PARSED-WIDTH ENDOF
      PARSED-WIDTH PARSED-HEIGHT PARSED-MINX PARSED-MINY 2DROP 2DROP
      PARSED-WIDTH PARSED-MINX MIN TO PARSED-MINX
      PARSED-HEIGHT PARSED-MINY MIN TO PARSED-MINY
      PARSED-WIDTH 1+ TO PARSED-WIDTH
    ENDCASE
  LOOP
  PARSED-MINX NEGATE PARSED-GRID grid.width +!
  PARSED-MINY NEGATE PARSED-GRID grid.height +!
  0 TO PARSED-WIDTH
  0 TO PARSED-HEIGHT
  ALIGN HERE
  PARSED-GRID grid.height @
  PARSED-GRID grid.width @ * >R
  R@ grid-cell * ALLOT
  PARSED-GRID grid.addr !
  R> 0 ?DO
    PARSED-GRID grid.addr @ I grid-cell * + >R
    GRID-0 R@ grid-cell.type C!
    FALSE R@ grid-cell.wseen C!
    FALSE R@ grid-cell.rseen C!
    2 R> grid-cell.invert C!
  LOOP
  PARSED-STR-LEN 0 ?DO
    PARSED-STR-ADDR I CHARS + C@ ENSURE-UNCHARA CASE
      CHAR-LF OF
        0 TO PARSED-WIDTH PARSED-HEIGHT 1+ TO PARSED-HEIGHT FALSE
      ENDOF
      [CHAR] / OF GRID-/ PARSED-GRID-CELL-TYPE! TRUE ENDOF
      [CHAR] \ OF GRID-\ PARSED-GRID-CELL-TYPE! TRUE ENDOF
      [CHAR] + OF GRID-+ PARSED-GRID-CELL-TYPE! TRUE ENDOF
      TRUE
    ENDCASE IF PARSED-WIDTH 1+ TO PARSED-WIDTH THEN
  LOOP ;

BEGIN-STRUCTURE point
  FIELD: point.x
  FIELD: point.y
END-STRUCTURE

CREATE POINT-ZERO point ALLOT 0 0 POINT-ZERO 2!

BEGIN-STRUCTURE grid-cell-def
  point +FIELD grid-cell-def.begin-white-up
  point +FIELD grid-cell-def.begin-white-down
  point +FIELD grid-cell-def.begin-red-up
  point +FIELD grid-cell-def.begin-red-down
  point +FIELD grid-cell-def[0,1]
  point +FIELD grid-cell-def[1,0]
  point +FIELD grid-cell-def[0,-1]
  point +FIELD grid-cell-def[-1,0]
END-STRUCTURE

BEGIN-STRUCTURE grid-cell-defs-t
  grid-cell-def +FIELD grid-cell-defs./
  grid-cell-def +FIELD grid-cell-defs.\
  grid-cell-def +FIELD grid-cell-defs.+
END-STRUCTURE

CREATE GRID-CELL-DEFS grid-cell-defs-t ALLOT

: DIR-FLAT ( n n -- u )
  1+ 3 * SWAP 1+ + ;

: grid-cell-def[] ( n n grid-cell-def -- point )
  >R DIR-FLAT CASE
    0 0 DIR-FLAT OF 0 ENDOF
    0 1 DIR-FLAT OF 4 ENDOF
    1 0 DIR-FLAT OF 5 ENDOF
    0 -1 DIR-FLAT OF 6 ENDOF
    -1 0 DIR-FLAT OF 7 ENDOF
    1 THROW
  ENDCASE point * R> + ;

: 4DUP 2>R 2>R 2R@ 2R> 2R@ 2SWAP 2R> ;

: DEFINE-CELL-CONNECTION ( n n n n grid-cell-def -- )
  >R 4DUP NEGATE SWAP NEGATE SWAP 2SWAP R@ grid-cell-def[] 2!
  2SWAP NEGATE SWAP NEGATE SWAP 2SWAP R> grid-cell-def[] 2! ;

0 1 1 0 GRID-CELL-DEFS grid-cell-defs./ DEFINE-CELL-CONNECTION
0 -1 -1 0 GRID-CELL-DEFS grid-cell-defs./ DEFINE-CELL-CONNECTION
0 -1 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-white-up 2!
-1 0 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-white-down 2!
0 1 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-red-up 2!
1 0 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-red-down 2!

0 1 -1 0 GRID-CELL-DEFS grid-cell-defs.\ DEFINE-CELL-CONNECTION
0 -1 1 0 GRID-CELL-DEFS grid-cell-defs.\ DEFINE-CELL-CONNECTION
0 -1 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-white-up 2!
1 0 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-white-down 2!
0 1 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-red-up 2!
-1 0 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-red-down 2!

0 1 0 -1 GRID-CELL-DEFS grid-cell-defs.+ DEFINE-CELL-CONNECTION
1 0 -1 0 GRID-CELL-DEFS grid-cell-defs.+ DEFINE-CELL-CONNECTION
0 -1 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-white-up 2!
0 1 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-white-down 2!
-1 0 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-red-up 2!
1 0 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-red-down 2!

: GRID-CELL-DEF-BEGINS ( u grid-cell -- point[2] grid-cell-def )
  >R R@ grid-cell.invert C@ 1 = IF 1 SWAP - THEN
  GRID-CELL-DEFS R> grid-cell.type C@ 1- grid-cell-def * + >R
  point 2* * R@ + R> ;

BEGIN-STRUCTURE traxer-state
  point +FIELD traxer-state.pos
  point +FIELD traxer-state.prev-pos
  CFIELD: traxer-state.go?
  CFIELD: traxer-state.first
  CFIELD: traxer-state.colour
  CFIELD: traxer-state.dir
  CFIELD: traxer-state.bump
  ALIGNED
END-STRUCTURE

CREATE TRAXER-STATES traxer-state 4 * ALLOT

0 TRAXER-STATES traxer-state 0 * + traxer-state.colour C!
0 TRAXER-STATES traxer-state 1 * + traxer-state.colour C!
1 TRAXER-STATES traxer-state 2 * + traxer-state.colour C!
1 TRAXER-STATES traxer-state 3 * + traxer-state.colour C!
0 TRAXER-STATES traxer-state 0 * + traxer-state.dir C!
1 TRAXER-STATES traxer-state 1 * + traxer-state.dir C!
0 TRAXER-STATES traxer-state 2 * + traxer-state.dir C!
1 TRAXER-STATES traxer-state 3 * + traxer-state.dir C!

0 VALUE CURRENT-TRAXER
CREATE TRAXER-OLDPOS point ALLOT
0 VALUE CURRENT-GRID-CELL
0 VALUE CURRENT-GRID-CELL-DEF
0 VALUE CURRENT-GRID-CELL-BEGINS
0 VALUE NEXT-GRID-CELL
0 VALUE NEXT-GRID-CELL-DEF
0 VALUE NEXT-GRID-CELL-BEGINS
0 VALUE FOUND-LOOP

: COLOUR-MISMATCH ( n n -- flag )
  ENABLE-BUG IF
    ."    diff "
    2DUP SWAP . . CR
  THEN
  DIR-FLAT 2 0 DO
    DUP NEXT-GRID-CELL-BEGINS I point * +
    DUP point.x @ SWAP point.y @ DIR-FLAT = IF
      DROP FALSE UNLOOP EXIT
    THEN
  LOOP DROP TRUE ;

: FIND-DIRECTION ( -- )
  2 0 DO
    CURRENT-GRID-CELL-BEGINS I
    CURRENT-TRAXER traxer-state.dir C@ 1 = IF 1 SWAP - THEN
    point * + >R
    CURRENT-TRAXER traxer-state.pos point.x @ R@ point.x @ +
    CURRENT-TRAXER traxer-state.pos point.y @ R> point.y @ +
    2DUP TRAXER-OLDPOS point.y @ =
    SWAP TRAXER-OLDPOS point.x @ =
    AND 0= IF
      CURRENT-TRAXER traxer-state.pos point.y !
      CURRENT-TRAXER traxer-state.pos point.x !
      UNLOOP EXIT
    THEN 2DROP
  LOOP ;

: FORWARD-TRAXER ( traxer-state -- flag )
  TO CURRENT-TRAXER
  CURRENT-TRAXER traxer-state.go? C@ 0= IF FALSE EXIT THEN
  ENABLE-BUG IF
    CR ." >> color "
    CURRENT-TRAXER traxer-state.colour C@ . CR
    ."    dir "
    CURRENT-TRAXER traxer-state.dir C@ . CR
    ."    from "
    CURRENT-TRAXER traxer-state.prev-pos DUP point.y @ SWAP point.x @ . . CR
    ."    at "
    CURRENT-TRAXER traxer-state.pos DUP point.y @ SWAP point.x @ . . CR
  THEN
  CURRENT-TRAXER traxer-state.prev-pos
  TRAXER-OLDPOS point MOVE
  CURRENT-TRAXER traxer-state.pos
  CURRENT-TRAXER traxer-state.prev-pos point MOVE
  CURRENT-TRAXER traxer-state.pos DUP point.x @ SWAP point.y @ PARSED-GRID
  grid[] TO CURRENT-GRID-CELL
  ENABLE-BUG IF
    ."    ( type "
    CURRENT-GRID-CELL grid-cell.type C@ .
    ." inv "
    CURRENT-GRID-CELL grid-cell.invert C@ .
    ." )" CR
  THEN
  CURRENT-GRID-CELL grid-cell.type C@ GRID-0 = IF
    ENABLE-BUG IF
      ."    reject null source " CR
    THEN
    FALSE EXIT
  THEN
  CURRENT-GRID-CELL grid-cell.invert C@ 2 = IF
    0 CURRENT-GRID-CELL grid-cell.invert C!
  THEN
  CURRENT-TRAXER traxer-state.colour C@ CURRENT-GRID-CELL GRID-CELL-DEF-BEGINS
  TO CURRENT-GRID-CELL-DEF TO CURRENT-GRID-CELL-BEGINS
  CURRENT-GRID-CELL-DEF CURRENT-GRID-CELL-BEGINS CURRENT-TRAXER DROP 2DROP
  FIND-DIRECTION
  CURRENT-TRAXER traxer-state.pos DUP point.x @ SWAP point.y @ PARSED-GRID
  grid[] TO NEXT-GRID-CELL
  ENABLE-BUG IF
    ."    to "
    CURRENT-TRAXER traxer-state.pos DUP point.y @ SWAP point.x @ . . CR
    ."    ( type "
    NEXT-GRID-CELL grid-cell.type C@ .
    ." inv "
    NEXT-GRID-CELL grid-cell.invert C@ .
    ." )" CR
  THEN
  CURRENT-GRID-CELL grid-cell.wseen
  CURRENT-TRAXER traxer-state.colour C@ CHARS + C@
  IF
    ENABLE-BUG IF
      ."    reject seen source " CR
    THEN
    FALSE EXIT
  THEN
  CURRENT-TRAXER traxer-state.first C@ 0= IF
    TRUE CURRENT-GRID-CELL grid-cell.wseen
    CURRENT-TRAXER traxer-state.colour C@ CHARS + C!
  THEN
  FALSE CURRENT-TRAXER traxer-state.first C!
  NEXT-GRID-CELL NULL-GRID-CELL = IF
    TRUE CURRENT-TRAXER traxer-state.bump C!
  THEN
  NEXT-GRID-CELL grid-cell.type C@ GRID-0 = IF
    ENABLE-BUG IF
      ."    reject null target " CR
    THEN
    FALSE EXIT
  THEN
  CURRENT-TRAXER traxer-state.colour C@ NEXT-GRID-CELL GRID-CELL-DEF-BEGINS
  TO NEXT-GRID-CELL-DEF TO NEXT-GRID-CELL-BEGINS
  NEXT-GRID-CELL grid-cell.wseen
  CURRENT-TRAXER traxer-state.colour C@ CHARS + C@ IF
    ENABLE-BUG IF
      ."    found loop" CR
    THEN
    TRUE TO FOUND-LOOP
  THEN TRUE ;

BEGIN-STRUCTURE vstack
  FIELD: vstack.addr
  FIELD: vstack.len
END-STRUCTURE

0 VALUE VSTACK-ITEM

: VSTACK-PUSH ( addr vstack -- )
  >R R@ vstack.addr @ R@ vstack.len @
  VSTACK-ITEM * + VSTACK-ITEM MOVE
  1 R> vstack.len +! ;

: VSTACK-POP ( addr vstack -- flag )
  DUP vstack.len @ 0> 0= IF 2DROP FALSE EXIT THEN
  >R -1 R@ vstack.len +!
  R@ vstack.addr @ R> vstack.len @
  VSTACK-ITEM * + SWAP VSTACK-ITEM MOVE TRUE ;

CREATE QUEUE vstack ALLOT

: IMPLODE-POS ( u u -- u )
  PARSED-GRID grid.width @ * + ;

: EXPLODE-POS ( u -- u u )
  PARSED-GRID grid.width @ /MOD ;

BEGIN-STRUCTURE queue-elem-t
  FIELD: queue-elem.pos
END-STRUCTURE

CREATE QUEUE-ELEM queue-elem-t ALLOT

: NORM-PUSH ( n n -- FLAG )
  2DUP IMPLODE-POS QUEUE-ELEM !
  PARSED-GRID grid[] >R
  R@ grid-cell.type C@ GRID-0 =
  R@ grid-cell.wseen C@ 0= 0= OR 0= R> SWAP IF
    grid-cell.wseen TRUE SWAP C!
    QUEUE-ELEM QUEUE VSTACK-PUSH
  ELSE DROP THEN ;

: NORMALIZE ( -- )
  PARSED-GRID DUP grid.height @ SWAP grid.width @ * DUP point *
  ALIGN HERE QUEUE vstack.addr ! queue-elem-t * ALLOT
  0 QUEUE vstack.len !
  queue-elem-t TO VSTACK-ITEM
  DUP 0 ?DO
    I PARSED-GRID grid.width @ /MOD 2DUP
    TO PARSED-HEIGHT TO PARSED-WIDTH
    NORM-PUSH
    ENABLE-BUG IF
      CR ." [ flood fill at "
      PARSED-WIDTH . PARSED-HEIGHT .
      ."  ]" CR
    THEN
    BEGIN
      QUEUE-ELEM QUEUE VSTACK-POP
    WHILE
      QUEUE-ELEM @ EXPLODE-POS 2DUP TO PARSED-HEIGHT TO PARSED-WIDTH
      PARSED-GRID grid[] DUP TO CURRENT-GRID-CELL
      CURRENT-GRID-CELL grid-cell.invert C@ 2 = IF
        0 CURRENT-GRID-CELL grid-cell.invert C!
      THEN
      ENABLE-BUG IF
        CR ." >> pos "
        PARSED-WIDTH PARSED-HEIGHT SWAP . . CR
      THEN
      ENABLE-BUG IF
        ."    ( type "
        CURRENT-GRID-CELL grid-cell.type C@ .
        ." inv "
        CURRENT-GRID-CELL grid-cell.invert C@ .
        ." )" CR
      THEN
      DUP grid-cell.type C@ GRID-0 = IF 0 ELSE 2 THEN 0 ?DO
        ENABLE-BUG IF
          ."    color "
          I . CR
        THEN
        DUP I SWAP GRID-CELL-DEF-BEGINS
        TO CURRENT-GRID-CELL-DEF
        TO CURRENT-GRID-CELL-BEGINS
        2 0 DO
          CURRENT-GRID-CELL-BEGINS I point * + DUP point.x @ SWAP point.y @
          ENABLE-BUG IF
            ."    dir "
            2DUP SWAP . . CR
          THEN
          2DUP PARSED-WIDTH PARSED-HEIGHT ROT + ROT ROT + SWAP 2DUP
          ENABLE-BUG IF
            ."    to "
            2DUP SWAP . . CR
          THEN
          NORM-PUSH PARSED-GRID grid[] DUP
          TO NEXT-GRID-CELL DUP grid-cell.type C@
          ENABLE-BUG IF
            ."    to "
            QUEUE-ELEM @ EXPLODE-POS SWAP . . CR
          THEN
          GRID-0 = IF
            ENABLE-BUG IF
              ."    reject null target " CR
            THEN
            DROP 2DROP
          ELSE
            J SWAP GRID-CELL-DEF-BEGINS
            TO NEXT-GRID-CELL-DEF
            TO NEXT-GRID-CELL-BEGINS
            NEGATE SWAP NEGATE SWAP
            COLOUR-MISMATCH IF
              ENABLE-BUG IF
                ."    inverting " CR
              THEN
              NEXT-GRID-CELL grid-cell.invert C@ 2 = 0= IF
                1 ABORT" VERTIGO"
              THEN
              1 NEXT-GRID-CELL grid-cell.invert C!
            ELSE
              NEXT-GRID-CELL grid-cell.invert C@ 2 = IF
                ENABLE-BUG IF
                  ."    default " CR
                THEN
                0 NEXT-GRID-CELL grid-cell.invert C!
              THEN
            THEN
          THEN
        LOOP
      LOOP DROP
    REPEAT
  LOOP DUP 0 ?DO
    I PARSED-GRID grid.width @ /MOD
    PARSED-GRID grid[]
    grid-cell.wseen FALSE SWAP C!
  LOOP DROP ;

: ANALYZE-GRID ( -- flag )
  PARSED-GRID grid.width @ PARSED-GRID grid.height @ * 0 ?DO
    I PARSED-GRID grid.height @ /MOD
    TO PARSED-HEIGHT TO PARSED-WIDTH
    ENABLE-BUG IF
      CR CR ." [ #" I . ." scanning at "
      PARSED-WIDTH . PARSED-HEIGHT .
      ." ]" CR
    THEN
    4 0 DO
      TRAXER-STATES I traxer-state * + >R
      PARSED-HEIGHT PARSED-WIDTH R@ traxer-state.pos 2!
      R@ traxer-state.pos
      R@ traxer-state.prev-pos point MOVE
      TRUE R@ traxer-state.go? C!
      TRUE R@ traxer-state.first C!
      FALSE R> traxer-state.bump C!
    LOOP
    FALSE TO FOUND-LOOP
    4 0 DO
      TRAXER-STATES I traxer-state * + FORWARD-TRAXER
      TRAXER-STATES I traxer-state * + traxer-state.go? C!
    LOOP
    TRUE CURRENT-GRID-CELL grid-cell.wseen C!
    TRUE CURRENT-GRID-CELL grid-cell.rseen C!
    BEGIN
      FOUND-LOOP 0=
      FALSE 4 0 DO
        TRAXER-STATES I traxer-state * + traxer-state.go? C@ OR
      LOOP AND
    WHILE
      ENABLE-BUG IF CR ." ..." CR THEN
      4 0 DO
        TRAXER-STATES I traxer-state * + FORWARD-TRAXER
        TRAXER-STATES I traxer-state * + traxer-state.go? C!
      LOOP
    REPEAT
    FOUND-LOOP IF
      ENABLE-BUG IF ." loop!" CR THEN FALSE UNLOOP EXIT
    THEN
    2 0 DO
      TRAXER-STATES I 2* 0 + traxer-state * + traxer-state.bump C@
      TRAXER-STATES I 2* 1 + traxer-state * + traxer-state.bump C@
      AND IF
        TRAXER-STATES I 2* 0 + traxer-state * + traxer-state.pos point.x @
        TRAXER-STATES I 2* 1 + traxer-state * + traxer-state.pos point.x @
        - ABS
        TRAXER-STATES I 2* 0 + traxer-state * + traxer-state.pos point.y @
        TRAXER-STATES I 2* 1 + traxer-state * + traxer-state.pos point.y @
        - ABS MAX 8 < 0= IF
          ENABLE-BUG IF ." line!" CR THEN FALSE UNLOOP UNLOOP EXIT
        THEN
      THEN
    LOOP
  LOOP TRUE ;

: ENTRY ( c-addr u -- flag )
  HERE >R ALIGN HERE grid ALLOT PARSE-GRID
  NORMALIZE ANALYZE-GRID
  R> HERE - ENABLE-BUG IF
    CR
    DUP NEGATE . ." bytes used" CR
  THEN ALLOT ;

1	Copyright (C)2024-2077 Amogus. All rights reserved.

# wtf.sh

FAST, SECURE, DOUBLE-ALGORITHMIC thue-morse sequence GENERATOR

Generates roughly 1 digit per 1 second, depending on CPU quality. If you
need more, please contact the developer to purchase a wtf.sh Pro
license.

## Usage

    PATH="$PATH":. wtf.sh

#include <cstdlib>
#include <iostream>

unsigned long  long   MAYBE_TRUE = 0;
unsigned long long  *  SLIGHTLY_TRUE = &MAYBE_TRUE;
unsigned long long * * MODERATELY_TRUE = &SLIGHTLY_TRUE;
unsigned long long *** VERY_TRUE = &MODERATELY_TRUE;

int main() {

	for (unsigned long long i = 0; (***VERY_TRUE = 42); i++) {

		unsigned long long digitals = 0;

		for (
			unsigned long long digitable = i;
			digitable;
			(digitals += digitable & 1), (digitable >>= 1)
		);

		printf("%llx", digitals & 1);

	}

}

#include <cstdlib>
#include <iostream>

unsigned long long number_ate(unsigned long long **input, unsigned long long size);

unsigned long long number_ate(unsigned long long **input, unsigned long long size) {

	unsigned long long *number = (unsigned long long*)realloc(*input, sizeof(unsigned long long) * size * 2);
	*input = number;

	for(int i = size, j = 0; i < size * 2; i++, j++) {
		number[i] = !number[j];
		printf("%llx", number[i]);
	}

	return number_ate(input, size * 2);

}

int main() {

	unsigned long long *number = (unsigned long long*)malloc(sizeof(unsigned long long));
	*number = 0;
	printf("%llx", *number);

	number_ate(&number, 1);

}

#!/bin/sh

dependnecy_satisfied=$({

	if [ -e /dev/null ]; then
		false
	else
		printf "/dev/null required but not found!!\n" >&2
		echo 0
	fi

	if [ -e /dev/stdin ]; then
		false
	else
		printf "/dev/stdin required but not found!!\n" >&2
		echo 0
	fi

	echo '[ <([ ]) ]' |. /dev/stdin 2>/dev/null>/dev/null;
	if [ ! $? -ne 0 ]; then
		false
	else
		printf "<( ) bashism required but not found!!\n" >&2
		echo 0
	fi

	if [ -e /dev/urandom ]; then
		false
	else
		printf "/dev/urandom required but not found!!\n" >&2
		echo 0
	fi

	if command -v openssl >/dev/null 2>&1; then
		false
	else
		printf "OpenSSL required but not found!!\n" >&2
		echo 0
	fi

	if command -v c++ >/dev/null 2>&1; then
		false
	else
		printf "C++ required but not found!!\n" >&2
		echo 0
	fi

	if command -v xxd >/dev/null 2>&1; then
		false
	else
		printf "xxd required but not found!!\n" >&2
		echo 0
	fi

	if command -v head >/dev/null 2>&1; then
		false
	else
		printf "head required but not found!!\n" >&2
		echo 0
	fi

	if command -v cat >/dev/null 2>&1; then
		false
	else
		printf "cat required but not found!!\n" >&2
		echo 0
	fi
	
	if command -v mkdir >/dev/null 2>&1; then
		false
	else
		printf "mkdir required but not found!!\n" >&2
		echo 0
	fi

	if command -v realpath >/dev/null 2>&1; then
		false
	else
		printf "realpath required but not found!!\n" >&2
		echo 0
	fi

	if command -v dirname >/dev/null 2>&1; then
		false
	else
		printf "dirname required but not found!!\n" >&2
		echo 0
	fi

	echo 1

})

if [ "$dependnecy_satisfied" = 1 ]
then
	false
else
	printf "FATAL: unsatisfied. dependnecy\n\n" >&2
	exit 1
fi

cd "$(dirname "$(realpath $0)")"

AMOGUS_ROOT=amoguses_"$(cat /dev/urandom | head -c 8 | xxd -p)"
mkdir -p "$AMOGUS_ROOT"
c++ ./slow_but_reliable.cpp -O0 -o "$AMOGUS_ROOT"/slow_but_reliable
c++ ./fast_but_sussy.cpp -O2 -o "$AMOGUS_ROOT"/fast_but_sussy

random_salt=$(cat /dev/urandom | head -c 8 | xxd -p)

secure_hash() {
	openssl kdf \
		-keylen 32 \
		-kdfopt digest:SHA256 \
		-kdfopt pass:"$(cat /dev/stdin)" \
		-kdfopt salt:$random_salt \
		-kdfopt iter:1000000 PBKDF2
}

desussify() {
	while true
	do
		trusted=$(head -c 1 $1);
		sussy=$(head -c 1 $2);
		trusted_hash=$(printf "%llx" $trusted | secure_hash)
		sussy_hash=$(printf "%llx" $sussy | secure_hash)
		if [ $trusted_hash = $sussy_hash ]
		then
			no_longer_sussy=$sussy
			printf "%llx" $no_longer_sussy;
		else
			printf "FATAL: sussy amogus\n" >&2
			exit 1
		fi
	done
}

{ sleep 0.01 && rm -rf "$AMOGUS_ROOT"; } &
	# sussy race condition: amoguses might get voted out before we run them
	# added a large delay to mitigate.

desussify \
	<("$AMOGUS_ROOT"/slow_but_reliable) \
	<("$AMOGUS_ROOT"/fast_but_sussy)

pub fn entry(haystack: &str, needle: &str) -> Option<(usize,usize)>

{let solver: solverstd::structs::implemented::SolverBuilderBuilder  = solverstd::structs::implemented::SolverBuilderBuilder::new();
   let solver: solverstd::structs::implemented::SolveBuilder      = solverstd::structs::implemented::SolverBuilderBuilder::haystack(solver,haystack);
 // // / / / / ////  // // //// / YOUR mom is GAY /// // / / / / // / / // / // / / / // // / //// / // /   //  / /
      let solver: solverstd::structs::implemented::Solverer   = solverstd::structs::implemented::SolveBuilder::needle(solver,needle);
 return solverstd::structs::implemented::Solverer::solve(&solver);}

   mod solverstd { pub mod structs { pub mod implemented {
trait CharIter: Iterator<Item=(usize,char)> + Clone {}
impl<T: Iterator<Item=(usize,char)> + Clone> CharIter for T {}
  struct IncompleteWord<'a> { begin: usize, stride: usize,
    characters_to_go: usize, character: char, characters: std::str::Chars<'a> 

   }  impl<'a> Solverer<'a> {
            pub fn solve(&'a self) -> std::option::Option<(usize,usize)> {
                if self.Lemonade.is_ascii() {
                    #[cfg(feature="timetest")]println!("ascii!");
                    let chariter = |i,s|self.hackstack.as_bytes()[i..].iter().enumerate().step_by(s).map(move|(o,c)|(o+i,unsafe{char::from_u32_unchecked(*c as u32)}));
                    self.solve_for_real(chariter)
                } else {
                    #[cfg(feature="timetest")]println!("unicode...");
                    let charinds = str::char_indices(self.hackstack).collect::<Vec<_>>();
                    let chariter = |i,s|charinds[i..].iter().step_by(s).copied();
                    self.solve_for_real(chariter)
                }
            }
             fn solve_for_real<T:CharIter,F:FnMut(usize,usize)->T>(&'a self, mut chariterf: F) -> std::option::Option<(usize,usize)> {#[cfg(any(feature="meow",not(feature="meow")))]{
                let meow: std::vec::Vec<char> = str::chars(self.Lemonade).collect();
                 let mut characterifier = meow.iter().copied();
	         let first_character = characterifier.next()?;
                let characterifier = characterifier;
             let second_character = characterifier.clone().next();

	            let mut word_seeds: std::vec::Vec<WordSeed<'a>> = std::vec::Vec::new();
                let mut bad_seeds: std::vec::Vec<usize> = std::vec::Vec::new();
#[cfg(feature="timetest")]let mut beginned = std::time::Instant::now();
#[cfg(feature="timetest")]println!("begin...");
         	   for (i,index, character) in chariterf(0,1).enumerate().map(|(i,(cind,character))|(i,cind,character)) {
	                 if second_character.map(|value|value==character).unwrap_or(false){
                         for (word_index, word_seed) in <[WordSeed]>::iter(std::borrow::Borrow::borrow(&word_seeds)).enumerate() {
                         if index+(index-word_seed.begin)*(self.Lemonade.len()-1)>self.hackstack.len() {
                             bad_seeds.push(word_index);
                            } else {
                         let mut count = 1;
                         if chariterf(i,index-word_seed.begin).map(|(_,character)|character).zip(characterifier.clone()).all(|(a,b)|{count+=1;a==b}) && count==self.Lemonade.len() {
                             return Some((word_seed.begin,index-word_seed.begin-1));
                         }
                            }
               }}
		          for word_index in bad_seeds.drain(..).rev() {
                          word_seeds.swap_remove(word_index);
                    }
                         if character == first_character {
                            if self.Lemonade.len()<2 { return Some((index,usize::MAX)); }
	                      std::vec::Vec::push(&mut word_seeds, WordSeed {begin : index, meow: std::marker::PhantomData});
                   }
                         #[cfg(feature="timetest")]{let meow = std::time::Instant::now(); if (meow-beginned).as_millis()>500 { beginned=meow;
                         println!("{} {}",index as f64 / self.hackstack.len() as f64,word_seeds.len())}}
	      	     }
              None
          	}
             }}
  pub struct

SolverBuilderBuilder { murder	//1 481 9991 003 884 4 2342342342 8jg LMK!fc gcc clang llvm
                	           	//rusted tragedy demonic recruitment
     :()
}
  pub struct SolveBuilder<'a> {
       haystack: &'a str,
  }

struct WordSeed<'a> {
	begin: usize,
    meow: std::marker::PhantomData<&'a str>,
 //  characters: std::str::Chars<'a>,
}

	pub struct Solverer<'a> {
		hackstack : &'a str,
		Lemonade : &'a str
	}

	impl SolverBuilderBuilder {
		pub fn new() -> Self {
			Self{murder:()}
		}

		pub fn haystack<'a>(self, hellostrat: &'a str) -> SolveBuilder<'a> {
			SolveBuilder {haystack: hellostrat}
		}
	}

   impl<'a> SolveBuilder<'a> {
     	pub fn needle(self, needLemon: &'a str) -> Solverer {
       Solverer {hackstack: self.haystack,
         Lemonade: needLemon}
          }
	}
}}}


#[cfg(test)]
mod tests {
    use super::*;

      fn strangle(stack: &str, index: Option<(usize,usize)>, len: usize) -> String {
        let mut buffer = String::new();
      let index = match index {
           None => {return buffer}
            Some(index) => {index}
            };
       for i in 0..len {
          buffer.push(stack.chars().nth(index.0 + i*(index.1)+i).unwrap());
      }
           return buffer;
   }

   #[test]
  fn it_works() {
         let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "S");
       assert!(match result {Some((n,_))=>n==3,None=>false}, "S test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,1));

         let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SA");
          assert_eq!(Some((3, 15)), result, "SA test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,2));

     let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SAD");
    assert_eq!(Some((10, 8)), result, "SAD test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,3));

          let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SCAM");
	  assert_eq!(Some((9, 4)), result, "SCAM test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,4));

      	let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "GAY");
        assert_eq!(Some((39, 0)), result, "GAY test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,3));

      let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SICK");
     	assert_eq!(None, result, "SICK test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,4));
    }

   //#[test]
      //fn it_does_not_works() {
    //      unsafe{
      //    *std::mem::transmute::<_,*mut u64>(std::ptr::null::<u8>()) = 42;
  //     };
      //}
}

1 2	/target /Cargo.lock

[package]
name = "biblical"
version = "0.1.0"
edition = "2021"
[features]
timetest=[]
[dependencies]
dyn-clone = "1.0.16"

   #include <condition_variable>
 #include <scoped_allocator>
#include <initializer_list>
#include <source_location>
#include <memory_resource>
 #include <unordered_map>
   #include <unordered_set>
      #include <system_error>
         #include <shared_mutex>
            #include <forward_list>
                #include <string_view>
                     #include <type_traits>
                         #include <stacktrace>
                              #include <inttypes.h>
                                   #include <stop_token>
                                       #include <filesystem>
                                            #include <spanstream>
                                                #include <syncstream>
                                                   #include <functional>
                                                      #include <cinttypes>
                                                         #include <stdexcept>
                                                           #include <streambuf>
                                                            #include <execution>
                                                            #include <algorithm>
                                                            #include <semaphore>
                                                           #include <typeindex>
                                                         #include <exception>
                                                      #include <locale.h>
                                                   #include <limits.h>
                                                #include <iterator>
                                            #include <wctype.h>
                                       #include <stdfloat>
                                   #include <charconv>
                              #include <optional>
                         #include <signal.h>
                     #include <expected>
                #include <assert.h>
            #include <setjmp.h>
         #include <concepts>
      #include <stdint.h>
   #include <stddef.h>
 #include <typeinfo>
#include <stdarg.h>
#include <valarray>
#include <stdlib.h>
 #include <string.h>
   #include <iostream>
      #include <csetjmp>
         #include <cassert>
            #include <cwctype>
                #include <compare>
                     #include <variant>
                         #include <cstdlib>
                              #include <cstddef>
                                   #include <float.h>
                                       #include <ctype.h>
                                            #include <cstring>
                                                #include <cstdarg>
                                                   #include <csignal>
                                                      #include <errno.h>
                                                         #include <sstream>
                                                           #include <fstream>
                                                            #include <stdio.h>
                                                            #include <utility>
                                                            #include <numeric>
                                                           #include <climits>
                                                         #include <codecvt>
                                                      #include <version>
                                                   #include <cstdint>
                                                #include <barrier>
                                            #include <ostream>
                                       #include <wchar.h>
                                   #include <uchar.h>
                              #include <numbers>
                         #include <istream>
                     #include <iomanip>
                #include <complex>
            #include <clocale>
         #include <string>
      #include <cwchar>
   #include <vector>
 #include <limits>
#include <locale>
#include <cstdio>
#include <cctype>
 #include <cuchar>
   #include <ranges>
      #include <random>
         #include <iosfwd>
            #include <format>
                #include <atomic>
                     #include <bitset>
                         #include <cfloat>
                              #include <chrono>
                                   #include <future>
                                       #include <math.h>
                                            #include <thread>
                                                #include <time.h>
                                                   #include <cerrno>
                                                      #include <fenv.h>
                                                         #include <memory>
                                                           #include <mutex>
                                                            #include <cfenv>
                                                            #include <queue>
                                                            #include <ctime>
                                                           #include <stack>
                                                         #include <deque>
                                                      #include <latch>
                                                   #include <tuple>
                                                #include <cmath>
                                            #include <array>
                                       #include <regex>
                                   #include <ratio>
                              #include <list>
                         #include <span>
                     #include <bit>
                #include <ios>
            #include <new>
         #include <set>
      #include <any>
   #include <map>
 using namespace std;
// waiter waiter!
// more sexual transmited dieseses please!!
typedef struct
{ double val;
  int count;
  int prev;} Linky;
extern int entry(double *input, int len, double **output)
{ vector<Linky>things={};
  things.push_back(Linky{0,0,0});
  vector<int>thing_index={};
  unordered_map<double,int>maxlens={};
  vector<int*>imaxlens={};
  for(int i=0;i<len;i++)
  maxlens[input[i]]=1;
  for(int i=0;i<len;i++)
  imaxlens.push_back(&maxlens[input[i]]);
  int counter=0;
  int nextgc=1;
  vector<Linky>thingbuf={};
  for(int ii=0;ii<len;ii++)
  { auto x=input[ii];
    thingbuf.push_back(Linky{x,1,-1});
    counter++;
    Linky v;
    things[0].val=x;
    int mid=upper_bound(thing_index.begin(),thing_index.end(),0,
    [&](int a, int b){return things[a].val>things[b].val;})-thing_index.begin();
    for(int i=mid;i<thing_index.size()&&(v=things[thing_index[i]],1);i++)
    { if(v.count+1>*imaxlens[ii])
      { thingbuf.push_back(Linky{x,v.count+1,thing_index[i]});
        *imaxlens[ii]=v.count+1;
        counter++; }}
    auto oldend=thing_index.size();
    sort(thingbuf.begin(),thingbuf.end(),[&](auto a,auto b){return a.val>b.val;});
    for(auto v: thingbuf)
    thing_index.push_back(things.size()),things.push_back(v);
    inplace_merge(thing_index.begin(),thing_index.begin()+oldend,thing_index.end(),
    [&](int a, int b){return things[a].val>things[b].val;});
    if(counter>nextgc)
    { thing_index.resize(remove_if(thing_index.begin(),thing_index.end(),
      [&](auto i){return things[i].count<maxlens[things[i].val];})-thing_index.begin());
      nextgc+=thing_index.size(); }
    #ifdef ENTRY_DEBUG
    cout<<x<<" -> "<<mid<<" {"<<endl;int n=0;for(auto i:thing_index)
    {auto v=things[i];cout<<"  "<<(n++)<<": ";;for(;;v=things[v.prev])
    {cout<<v.val<<" ";if(v.prev==-1)break;}cout<<"\n";}
    cout<<"}\n";
    #endif
    thingbuf.clear(); }
  Linky bestest=things[1];
  int bestest_len=bestest.count;
  for(auto it=things.begin()+2;it<things.end();it++)
  { if(it->count>bestest_len)
    bestest=*it,
    bestest_len=it->count; }
  double* out;
  int count=0;
  Linky outlinky=bestest;
  for(;;outlinky=things[outlinky.prev])
  { count++;
    if(outlinky.prev==-1)break; }
  out=(double*)malloc(sizeof(double)*count);
  *output=out;
  outlinky=bestest;
  for(int i=0;;outlinky=things[outlinky.prev],i++)
  { if(i>=count) abort();
    out[i]=outlinky.val;
    if(outlinky.prev==-1)break; }
  reverse(out,out+count);
  return count; }
int main ()
{ vector<double>input=vector<double>();
  for(istream_iterator<double>it
     =istream_iterator<double>(cin);
  it!=istream_iterator<double>()
        ;it++)input.push_back(*it);
  double *out;
  int count=entry(input.data(),input.size(),&out);
  for(int i=0;i<count;i++)cout<<out[i]<<endl;
  free(out);
  return 0; }

mreow=((meowest,submissive,meow,mreow,Mreow)=>{meow =_=>
new Set();meowest=(prrr,Meow)=>!((mreow,Prrr)=>
{Prrr=meow();for(mreow of Meow)
{if((meow=>(meow=JSON.stringify(meow),Prrr.has(meow)?1:(Prrr
.add(meow),0)))(prrr.map(i=>mreow[i]))){return 1}}//          ^     ^   - Meow
return 0;})();submissive=(owo,//                            /  |   |  \
uwu)=>((Owo,Uwu)=>{for(;Owo>=0//                           | \___.___/ |
&&Uwu>=0;Owo--,Uwu--)while(owo[Owo]!=uwu[Uwu]//            \           /
&&Owo>=0)Owo--;Owo++;Uwu++;return Uwu>=0&&Owo>=0})(owo.length-1,uwu.length
-1);Mreow=(meow,mreow,mrrp,prrr,Prrr,Meow)=>(//
(nyaa,Mrrp)=>{if(Meow.length<=//              prrr
1){meow.mrrp.push([]);return}Mrrp=0;for(;mrrp<prrr;mrrp++){
/* * * * * */nyaa=mreow.concat([mrrp]);if(/*  prrr   */    meowest  (nyaa,Meow))
/*   ^ ^   */{meow.mrrp.forEach((prrr,Prrr)=>(prrr!=[][0]? submissive(prrr,nyaa)
/*  (O_O)  */&&(meow.mrrp[Prrr]=[][0]):Mrrp++));Mrrp
/*  /   \  */>=meow.mrrp.length/2&&(meow.mrrp=meow.mrrp.   filter // ( mreow ? )
/*  ^^ ^^  */(meow=>(meow!=[][0])));meow.mrrp.push//       dismissive( :(  ;w; )
/*|||||||||*/(nyaa)}else Mreow(meow,nyaa,mrrp+1,
/*.-.-.-.-.*/ prrr,Prrr,Meow)}})();mreow
=(Prrr,...Meow)=>((prrr)=>(prrr={mrrp:[]},Mreow(prrr
,[],0,Prrr.length,Prrr,Meow),prrr.mrrp.filter(
meow=>meow!=[][0]).map(meow=>meow.map(meow=>
Prrr[meow]))))();return mreow})()

/*
consowo.meow(mreow(
	["contest","date held","winner","winner's second name"],
	["dog fight","oct 17 2000","discarding sabot","sabot"],
	["cat-off","jul 01 2001","palm tree oil","tree"],
	["rat duel","oct 05 2001","cart of iron","of"],
	["rat duel","mar 21 2006","cart of iron","of"],
	["shark race","mar 21 2006","linguist",null]
))
//*/

use crate::game::*;
use rand::seq::IteratorRandom;
use rayon::prelude::*;
use std::cmp::Ordering;
use std::mem::swap;

pub trait Bottable<P: GamePlayer, M: GameMove>: Game<P, M> {
    fn random_move(&self) -> Option<M> {
        let mut rng = rand::thread_rng();
        return self.moves().choose(&mut rng);
    }
    fn best_move(&self) -> Option<M> {
        let p = self.current_player();
        let moves = self.moves().collect::<Vec<M>>();
        if moves.is_empty() {
            return None;
        } else if moves.len() == 1 {
            return moves.into_iter().next();
        }
        let mut score: Vec<f64> = vec![0.0; moves.len()];
        let mut weights: Vec<f64> = vec![0.0; moves.len()];
        let mut weights_old: Vec<f64> = vec![0.0; moves.len()];
        loop {
            (&moves).into_par_iter().zip(&mut score).for_each(|(m, c)| {
                *c += (0..2048)
                    .into_par_iter()
                    .map(|_| self.clone())
                    .map(|mut game| {
                        let mut m = *m;
                        loop {
                            match game.apply(m).unwrap() {
                                MoveOutcome::Win(p2) => break if p2 == p { 1.0 } else { -1.0 },
                                MoveOutcome::Tie => break 0.0,
                                MoveOutcome::Pass => (),
                            }
                            m = game.random_move().unwrap();
                        }
                    })
                    .sum::<f64>();
            });
            let min_score = score.iter().copied().reduce(f64::min).unwrap();
            (&mut weights)
                .into_iter()
                .zip(&score)
                .for_each(|(c, s)| *c = s - min_score);
            let total: f64 = weights.iter().copied().sum::<f64>();
            // normalize scores
            if total > 0.0 {
                (&mut weights).into_iter().for_each(|c| *c /= total);
            } else {
                (&mut weights).into_iter().for_each(|c| *c = 0.0);
            }
            let deviation: f64 = weights
                .iter()
                .copied()
                .zip(weights_old.iter().copied())
                .max_by(|(a, _), (b, _)| a.partial_cmp(b).unwrap_or(Ordering::Equal))
                .map(|(s, s_old)| f64::abs(s - s_old))
                .unwrap();
            if deviation < (1.0 / f64::powf(2.0, 12.0)) {
                break Some(
                    moves
                        .into_iter()
                        .zip(weights)
                        .max_by(|(_, a), (_, b)| a.partial_cmp(b).unwrap_or(Ordering::Equal))
                        .unwrap()
                        .0,
                );
            }
            swap(&mut weights, &mut weights_old);
        }
    }
}

impl<P: GamePlayer, M: GameMove, T: Game<P, M>> Bottable<P, M> for T {}

use crate::game::*;
use std::fmt;

#[derive(Clone)]
pub struct Four<P> {
    player: P,
    data: [(u8, [Option<P>; 6]); 7],
    filled: u8,
    done: bool,
}

impl<P: GamePlayer + fmt::Display> fmt::Display for Four<P> {
    fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
        formatter.write_str("\n")?;
        for y in (0..6).rev() {
            formatter.write_str(" ")?;
            for x in 0..7 {
                match self.data[x].1[y] {
                    Some(p) => formatter.write_fmt(format_args!("{} ", &p)),
                    None => formatter.write_fmt(format_args!(". ")),
                }?;
            }
            formatter.write_str("\n")?;
        }
        formatter.write_str(" ")?;
        for x in 0..7 {
            formatter.write_fmt(format_args!("{} ", x + 1))?;
        }
        formatter.write_str("\n")?;
        Ok(())
    }
}

#[derive(Copy, Clone)]
pub struct FourMove(u8);
impl GameMove for FourMove {}
impl fmt::Display for FourMove {
    fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
        (self.0 + 1).fmt(formatter)
    }
}
impl TryFrom<u8> for FourMove {
    type Error = ();
    fn try_from(num: u8) -> Result<Self, ()> {
        if num >= 1 && num <= 7 {
            Ok(Self(num - 1))
        } else {
            Err(())
        }
    }
}

pub struct FourMoves<'a, P: 'a> {
    cols: std::iter::Enumerate<std::slice::Iter<'a, (u8, [Option<P>; 6])>>,
    size: usize,
}

impl<'a, P: GamePlayer> Iterator for FourMoves<'a, P> {
    type Item = FourMove;
    fn next(&mut self) -> Option<Self::Item> {
        let r = self.cols.find(|(_, d)| d.0 < 6).map(|(x, _)| {
            self.size -= 1;
            FourMove(x as u8)
        });
        r
    }
    fn size_hint(&self) -> (usize, Option<usize>) {
        (self.size, Some(self.size))
    }
}

impl<P: GamePlayer> Four<P> {
    const DIRS: [[[i8; 2]; 2]; 4] = [
        [[0, -1], [0, 1]],
        [[-1, 0], [1, 0]],
        [[-1, -1], [1, 1]],
        [[1, -1], [-1, 1]],
    ];
    pub fn new() -> Self {
        Self {
            player: P::first(),
            data: [(0, [None; 6]); 7],
            filled: 0,
            done: false,
        }
    }
}

impl<P: GamePlayer> Game<P, FourMove> for Four<P> {
    type Moves<'a> = FourMoves<'a, P> where P: 'a;
    fn current_player(&self) -> P {
        self.player
    }
    fn moves<'a>(&'a self) -> Self::Moves<'a> {
        FourMoves {
            cols: self.data.iter().enumerate(),
            size: self.data.iter().filter(|d| d.0 < 6).count(),
        }
    }
    fn apply(&mut self, m: FourMove) -> Option<MoveOutcome<P>> {
        use MoveOutcome::*;
        if self.done {
            return None;
        }
        let x = m.0;
        if x >= 7 {
            return None;
        }
        let col = &mut self.data[x as usize];
        if col.0 >= 6 {
            return None;
        }
        let y = col.0;
        col.1[y as usize] = Some(self.player);
        col.0 += 1;
        self.filled += 1;
        for axis in Self::DIRS.iter() {
            let mut count = 1;
            for dir in axis.iter() {
                let (mut x, mut y) = (x as i8, y as i8);
                loop {
                    (x, y) = (x + dir[0], y + dir[1]);
                    if x < 0
                        || x >= 7
                        || y < 0
                        || y >= 6
                        || self.data[x as usize].1[y as usize].map_or(true, |p| p != self.player)
                    {
                        break;
                    }
                    count += 1;
                    if count >= 4 {
                        self.done = true;
                        return Some(Win(self.player));
                    }
                }
            }
        }
        self.player = self.player.next();
        Some(if self.filled >= 6 * 7 {
            self.done = true;
            Tie
        } else {
            Pass
        })
    }
}

#[derive(Debug)]
pub enum MoveOutcome<P> {
    Win(P),
    Tie,
    Pass,
}

pub trait GamePlayer: Copy + Clone + Eq + Send + Sync {
    fn first() -> Self;
    fn next(&self) -> Self;
}

pub trait GameMove: Copy + Clone + Send + Sync {}

pub trait Game<P: GamePlayer, M: GameMove>: Clone + Send + Sync {
    type Moves<'a>: Iterator<Item = M> + Sized
    where
        Self: 'a;
    fn current_player(&self) -> P;
    fn moves<'a>(&'a self) -> Self::Moves<'a>;
    fn apply(&mut self, m: M) -> Option<MoveOutcome<P>>;
}

mod bot;
mod four;
mod game;
mod pl2;

use bot::Bottable;
use crossterm::tty::IsTty;
use four::{Four, FourMove};
use game::*;
use pl2::BinaryPlayer;
use std::io::{self, BufRead, Write};

#[derive(Debug)]
enum Miscommunication {
    Io(io::Error),
    MoveParse,
    ModeParse,
}

impl From<io::Error> for Miscommunication {
    fn from(error: io::Error) -> Self {
        Self::Io(error)
    }
}

fn handle_outcome<P: GamePlayer>(mmeee: P, out: MoveOutcome<P>) -> (&'static str, bool) {
    match out {
        MoveOutcome::Win(p) => (
            if p == mmeee {
                "YIPPIEE I WINNER"
            } else {
                "nuuuu :("
            },
            false,
        ),
        MoveOutcome::Tie => ("meh", false),
        MoveOutcome::Pass => ("...", true),
    }
}

fn apply_debugged<P: GamePlayer, M: GameMove, T: Game<P, M> + std::fmt::Display>(
    mmeee: P,
    game: &mut T,
    m: M,
    istty: bool,
) -> bool {
    let (msg, out) = handle_outcome(mmeee, game.apply(m).expect("unexpected move failure"));
    if istty {
        eprintln!("{}{}", &game, msg);
    }
    out
}

use clap::Parser;

#[derive(Parser, Debug)]
#[command(author, version, about, long_about = None)]
struct Args {
    #[arg(short, long)]
    quite: bool,
    #[arg(short, long)]
    load: bool,
}

fn main() -> Result<(), Miscommunication> {
    let args = Args::parse();
    assert!(
        !(args.quite && args.load),
        "can't be load and quite at once..."
    );
    let mut game: Four<BinaryPlayer> = Four::new();
    let reader = io::stdin();
    let mut stdout = io::stdout();
    let istty = if !(args.quite || args.load) {
        reader.is_tty()
    } else {
        args.load
    };
    let mut reader = reader.lock().lines();
    let mmeee;
    loop {
        if istty {
            eprint!("> ");
        }
        match reader.next().ok_or(Miscommunication::ModeParse)??.as_str() {
            "f" => {
                mmeee = BinaryPlayer::first();
                let m = game.best_move().expect("first move fail");
                println!("{}", m);
                stdout.flush()?;
                assert!(
                    apply_debugged(mmeee, &mut game, m, istty),
                    "first move fail"
                );
                break;
            }
            "s" => {
                mmeee = BinaryPlayer::first().next();
                if istty {
                    eprintln!("{}", &game);
                }
                break;
            }
            _ => {
                if istty {
                    eprintln!("bad mode");
                }
            }
        }
    }
    let mut reader = reader.map(|l| l.map(|s| s.parse::<u8>()));
    loop {
        loop {
            let m = loop {
                if istty {
                    eprint!("{}> ", game.current_player());
                }
                let num = reader.next().ok_or(Miscommunication::MoveParse)??.ok();
                if let Some(m) = num.map(|num| FourMove::try_from(num).ok()).flatten() {
                    break m;
                }
            };
            let out = game.apply(m);
            match out {
                Some(out) => {
                    let (msg, out) = handle_outcome(mmeee, out);
                    if !out {
                        if istty {
                            eprintln!("{}{}", &game, msg);
                        }
                        return Ok(());
                    }
                    break;
                }
                None => (),
            }
        }
        let m = game.best_move().expect("no moves");
        println!("{}", m);
        stdout.flush()?;
        if !apply_debugged(mmeee, &mut game, m, istty) {
            break;
        }
    }
    Ok(())
}

mod four;
mod game;
mod pl2;
use four::*;
use game::*;
use pl2::*;

use clap::Parser;
use std::ffi::{OsStr, OsString};
use std::io::{self, BufRead, BufReader, Write};
use std::mem::drop;
use std::process::{Child, ChildStdin, ChildStdout, Command, Stdio};

struct Bot {
    pub proc: Child,
    pub read: Option<BufReader<ChildStdout>>,
    pub write: Option<ChildStdin>,
}

impl Bot {
    fn new<S: AsRef<OsStr>>(program: S) -> io::Result<Self> {
        let mut proc = Command::new(program)
            .stdin(Stdio::piped())
            .stdout(Stdio::piped())
            .spawn()?;
        let read = proc.stdout.take().map(|s| BufReader::new(s));
        let write = proc.stdin.take();
        Ok(Self { proc, read, write })
    }
}

#[derive(Parser, Debug)]
#[command(author, version, about, long_about = None)]
struct Args {
    bot_x: OsString,
    bot_o: OsString,
}

fn main() -> io::Result<()> {
    let args = Args::parse();
    println!("Player X: {:#?}", &args.bot_x);
    println!("Player O: {:#?}", &args.bot_o);
    let mut bots = [Bot::new(&args.bot_x)?, Bot::new(&args.bot_o)?];
    if let Some(s) = &mut bots[0].write {
        s.write(b"f\n")?;
    }
    if let Some(s) = &mut bots[1].write {
        s.write(b"s\n")?;
    }
    let mut game: Four<BinaryPlayer> = Four::new();
    let mut line = String::new();
    let mut stdout = io::stdout();
    let mut bot_read = bots
        .iter_mut()
        .map(|bot| bot.read.take().expect("no stdin"))
        .collect::<Vec<_>>();
    let mut bot_write = bots
        .iter_mut()
        .map(|bot| bot.write.take().expect("no stdout"))
        .collect::<Vec<_>>();
    'iter: for (from, to) in [(0, 1), (1, 0)].into_iter().cycle() {
        let from = &mut bot_read[from];
        let to = &mut bot_write[to];
        let pl = game.current_player();
        match 'read: {
            line.clear();
            print!("waiting for {}... ", pl);
            stdout.flush()?;
            if from.read_line(&mut line).is_err() {
                println!("fail");
                break 'read None;
            }
            println!("output: {:?}", &line);
            to.write(&line.as_bytes())?;
            to.flush()?;
            match line.strip_suffix("\n").unwrap().parse::<u8>() {
                Ok(m) => FourMove::try_from(m).ok(),
                Err(_) => None,
            }
        } {
            Some(m) => {
                let out = match game.apply(m) {
                    Some(out) => {
                        print!("{}: {}.{}", pl, m, &game);
                        out
                    }
                    None => {
                        println!("{}: invalid move ({}).", pl, m);
                        println!("{} wins.", pl.next());
                        break 'iter;
                    }
                };
                match out {
                    MoveOutcome::Win(p) => {
                        println!("{} wins.", p);
                        break 'iter;
                    }
                    MoveOutcome::Tie => {
                        println!("Tie.");
                        break 'iter;
                    }
                    MoveOutcome::Pass => {
                        println!("...");
                    }
                }
            }
            None => {
                println!("{} generated invalid output: {:?}", pl, &line);
                println!("{} wins.", pl.next());
                break 'iter;
            }
        }
    }
    drop((bot_read, bot_write));
    let exits: Vec<_> = bots
        .into_iter()
        .map(|c| c.proc)
        .map(|mut c| c.wait())
        .collect();
    for e in exits {
        e?;
    }
    Ok(())
}

use crate::game::*;
use std::fmt;

#[derive(Copy, Clone, Eq, PartialEq, Debug)]
pub enum BinaryPlayer {
    X,
    O,
}

impl fmt::Display for BinaryPlayer {
    fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
        formatter.write_str(match self {
            Self::X => "X",
            Self::O => "O",
        })
    }
}

impl GamePlayer for BinaryPlayer {
    fn first() -> Self {
        Self::X
    }
    fn next(&self) -> Self {
        match self {
            Self::X => Self::O,
            Self::O => Self::X,
        }
    }
}

# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
version = 3

[[package]]
name = "anstream"
version = "0.6.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "2ab91ebe16eb252986481c5b62f6098f3b698a45e34b5b98200cf20dd2484a44"
dependencies = [
 "anstyle",
 "anstyle-parse",
 "anstyle-query",
 "anstyle-wincon",
 "colorchoice",
 "utf8parse",
]

[[package]]
name = "anstyle"
version = "1.0.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "7079075b41f533b8c61d2a4d073c4676e1f8b249ff94a393b0595db304e0dd87"

[[package]]
name = "anstyle-parse"
version = "0.2.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "317b9a89c1868f5ea6ff1d9539a69f45dffc21ce321ac1fd1160dfa48c8e2140"
dependencies = [
 "utf8parse",
]

[[package]]
name = "anstyle-query"
version = "1.0.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5ca11d4be1bab0c8bc8734a9aa7bf4ee8316d462a08c6ac5052f888fef5b494b"
dependencies = [
 "windows-sys",
]

[[package]]
name = "anstyle-wincon"
version = "3.0.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "f0699d10d2f4d628a98ee7b57b289abbc98ff3bad977cb3152709d4bf2330628"
dependencies = [
 "anstyle",
 "windows-sys",
]

[[package]]
name = "autocfg"
version = "1.1.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d468802bab17cbc0cc575e9b053f41e72aa36bfa6b7f55e3529ffa43161b97fa"

[[package]]
name = "bitflags"
version = "1.3.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "bef38d45163c2f1dde094a7dfd33ccf595c92905c8f8f4fdc18d06fb1037718a"

[[package]]
name = "bitflags"
version = "2.4.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "b4682ae6287fcf752ecaabbfcc7b6f9b72aa33933dc23a554d853aea8eea8635"

[[package]]
name = "cfg-if"
version = "1.0.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"

[[package]]
name = "clap"
version = "4.4.6"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d04704f56c2cde07f43e8e2c154b43f216dc5c92fc98ada720177362f953b956"
dependencies = [
 "clap_builder",
 "clap_derive",
]

[[package]]
name = "clap_builder"
version = "4.4.6"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "0e231faeaca65ebd1ea3c737966bf858971cd38c3849107aa3ea7de90a804e45"
dependencies = [
 "anstream",
 "anstyle",
 "clap_lex",
 "strsim",
]

[[package]]
name = "clap_derive"
version = "4.4.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "0862016ff20d69b84ef8247369fabf5c008a7417002411897d40ee1f4532b873"
dependencies = [
 "heck",
 "proc-macro2",
 "quote",
 "syn",
]

[[package]]
name = "clap_lex"
version = "0.5.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "cd7cc57abe963c6d3b9d8be5b06ba7c8957a930305ca90304f24ef040aa6f961"

[[package]]
name = "colorchoice"
version = "1.0.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "acbf1af155f9b9ef647e42cdc158db4b64a1b61f743629225fde6f3e0be2a7c7"

[[package]]
name = "crossbeam-deque"
version = "0.8.3"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ce6fd6f855243022dcecf8702fef0c297d4338e226845fe067f6341ad9fa0cef"
dependencies = [
 "cfg-if",
 "crossbeam-epoch",
 "crossbeam-utils",
]

[[package]]
name = "crossbeam-epoch"
version = "0.9.15"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ae211234986c545741a7dc064309f67ee1e5ad243d0e48335adc0484d960bcc7"
dependencies = [
 "autocfg",
 "cfg-if",
 "crossbeam-utils",
 "memoffset",
 "scopeguard",
]

[[package]]
name = "crossbeam-utils"
version = "0.8.16"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5a22b2d63d4d1dc0b7f1b6b2747dd0088008a9be28b6ddf0b1e7d335e3037294"
dependencies = [
 "cfg-if",
]

[[package]]
name = "crossterm"
version = "0.27.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "f476fe445d41c9e991fd07515a6f463074b782242ccf4a5b7b1d1012e70824df"
dependencies = [
 "bitflags 2.4.0",
 "crossterm_winapi",
 "libc",
 "mio",
 "parking_lot",
 "signal-hook",
 "signal-hook-mio",
 "winapi",
]

[[package]]
name = "crossterm_winapi"
version = "0.9.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "acdd7c62a3665c7f6830a51635d9ac9b23ed385797f70a83bb8bafe9c572ab2b"
dependencies = [
 "winapi",
]

[[package]]
name = "either"
version = "1.9.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "a26ae43d7bcc3b814de94796a5e736d4029efb0ee900c12e2d54c993ad1a1e07"

[[package]]
name = "getrandom"
version = "0.2.10"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "be4136b2a15dd319360be1c07d9933517ccf0be8f16bf62a3bee4f0d618df427"
dependencies = [
 "cfg-if",
 "libc",
 "wasi",
]

[[package]]
name = "heck"
version = "0.4.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "95505c38b4572b2d910cecb0281560f54b440a19336cbbcb27bf6ce6adc6f5a8"

[[package]]
name = "libc"
version = "0.2.149"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "a08173bc88b7955d1b3145aa561539096c421ac8debde8cbc3612ec635fee29b"

[[package]]
name = "lock_api"
version = "0.4.10"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "c1cc9717a20b1bb222f333e6a92fd32f7d8a18ddc5a3191a11af45dcbf4dcd16"
dependencies = [
 "autocfg",
 "scopeguard",
]

[[package]]
name = "log"
version = "0.4.20"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "b5e6163cb8c49088c2c36f57875e58ccd8c87c7427f7fbd50ea6710b2f3f2e8f"

[[package]]
name = "memoffset"
version = "0.9.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5a634b1c61a95585bd15607c6ab0c4e5b226e695ff2800ba0cdccddf208c406c"
dependencies = [
 "autocfg",
]

[[package]]
name = "mio"
version = "0.8.8"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "927a765cd3fc26206e66b296465fa9d3e5ab003e651c1b3c060e7956d96b19d2"
dependencies = [
 "libc",
 "log",
 "wasi",
 "windows-sys",
]

[[package]]
name = "parafour"
version = "0.1.0"
dependencies = [
 "clap",
 "crossterm",
 "rand",
 "rayon",
]

[[package]]
name = "parking_lot"
version = "0.12.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "3742b2c103b9f06bc9fff0a37ff4912935851bee6d36f3c02bcc755bcfec228f"
dependencies = [
 "lock_api",
 "parking_lot_core",
]

[[package]]
name = "parking_lot_core"
version = "0.9.8"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "93f00c865fe7cabf650081affecd3871070f26767e7b2070a3ffae14c654b447"
dependencies = [
 "cfg-if",
 "libc",
 "redox_syscall",
 "smallvec",
 "windows-targets",
]

[[package]]
name = "ppv-lite86"
version = "0.2.17"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5b40af805b3121feab8a3c29f04d8ad262fa8e0561883e7653e024ae4479e6de"

[[package]]
name = "proc-macro2"
version = "1.0.67"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "3d433d9f1a3e8c1263d9456598b16fec66f4acc9a74dacffd35c7bb09b3a1328"
dependencies = [
 "unicode-ident",
]

[[package]]
name = "quote"
version = "1.0.33"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5267fca4496028628a95160fc423a33e8b2e6af8a5302579e322e4b520293cae"
dependencies = [
 "proc-macro2",
]

[[package]]
name = "rand"
version = "0.8.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "34af8d1a0e25924bc5b7c43c079c942339d8f0a8b57c39049bef581b46327404"
dependencies = [
 "libc",
 "rand_chacha",
 "rand_core",
]

[[package]]
name = "rand_chacha"
version = "0.3.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "e6c10a63a0fa32252be49d21e7709d4d4baf8d231c2dbce1eaa8141b9b127d88"
dependencies = [
 "ppv-lite86",
 "rand_core",
]

[[package]]
name = "rand_core"
version = "0.6.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ec0be4795e2f6a28069bec0b5ff3e2ac9bafc99e6a9a7dc3547996c5c816922c"
dependencies = [
 "getrandom",
]

[[package]]
name = "rayon"
version = "1.8.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "9c27db03db7734835b3f53954b534c91069375ce6ccaa2e065441e07d9b6cdb1"
dependencies = [
 "either",
 "rayon-core",
]

[[package]]
name = "rayon-core"
version = "1.12.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5ce3fb6ad83f861aac485e76e1985cd109d9a3713802152be56c3b1f0e0658ed"
dependencies = [
 "crossbeam-deque",
 "crossbeam-utils",
]

[[package]]
name = "redox_syscall"
version = "0.3.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "567664f262709473930a4bf9e51bf2ebf3348f2e748ccc50dea20646858f8f29"
dependencies = [
 "bitflags 1.3.2",
]

[[package]]
name = "scopeguard"
version = "1.2.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "94143f37725109f92c262ed2cf5e59bce7498c01bcc1502d7b9afe439a4e9f49"

[[package]]
name = "signal-hook"
version = "0.3.17"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "8621587d4798caf8eb44879d42e56b9a93ea5dcd315a6487c357130095b62801"
dependencies = [
 "libc",
 "signal-hook-registry",
]

[[package]]
name = "signal-hook-mio"
version = "0.2.3"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "29ad2e15f37ec9a6cc544097b78a1ec90001e9f71b81338ca39f430adaca99af"
dependencies = [
 "libc",
 "mio",
 "signal-hook",
]

[[package]]
name = "signal-hook-registry"
version = "1.4.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d8229b473baa5980ac72ef434c4415e70c4b5e71b423043adb4ba059f89c99a1"
dependencies = [
 "libc",
]

[[package]]
name = "smallvec"
version = "1.11.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "942b4a808e05215192e39f4ab80813e599068285906cc91aa64f923db842bd5a"

[[package]]
name = "strsim"
version = "0.10.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "73473c0e59e6d5812c5dfe2a064a6444949f089e20eec9a2e5506596494e4623"

[[package]]
name = "syn"
version = "2.0.36"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "91e02e55d62894af2a08aca894c6577281f76769ba47c94d5756bec8ac6e7373"
dependencies = [
 "proc-macro2",
 "quote",
 "unicode-ident",
]

[[package]]
name = "unicode-ident"
version = "1.0.12"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "3354b9ac3fae1ff6755cb6db53683adb661634f67557942dea4facebec0fee4b"

[[package]]
name = "utf8parse"
version = "0.2.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "711b9620af191e0cdc7468a8d14e709c3dcdb115b36f838e601583af800a370a"

[[package]]
name = "wasi"
version = "0.11.0+wasi-snapshot-preview1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "9c8d87e72b64a3b4db28d11ce29237c246188f4f51057d65a7eab63b7987e423"

[[package]]
name = "winapi"
version = "0.3.9"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419"
dependencies = [
 "winapi-i686-pc-windows-gnu",
 "winapi-x86_64-pc-windows-gnu",
]

[[package]]
name = "winapi-i686-pc-windows-gnu"
version = "0.4.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6"

[[package]]
name = "winapi-x86_64-pc-windows-gnu"
version = "0.4.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f"

[[package]]
name = "windows-sys"
version = "0.48.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "677d2418bec65e3338edb076e806bc1ec15693c5d0104683f2efe857f61056a9"
dependencies = [
 "windows-targets",
]

[[package]]
name = "windows-targets"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "9a2fa6e2155d7247be68c096456083145c183cbbbc2764150dda45a87197940c"
dependencies = [
 "windows_aarch64_gnullvm",
 "windows_aarch64_msvc",
 "windows_i686_gnu",
 "windows_i686_msvc",
 "windows_x86_64_gnu",
 "windows_x86_64_gnullvm",
 "windows_x86_64_msvc",
]

[[package]]
name = "windows_aarch64_gnullvm"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "2b38e32f0abccf9987a4e3079dfb67dcd799fb61361e53e2882c3cbaf0d905d8"

[[package]]
name = "windows_aarch64_msvc"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "dc35310971f3b2dbbf3f0690a219f40e2d9afcf64f9ab7cc1be722937c26b4bc"

[[package]]
name = "windows_i686_gnu"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "a75915e7def60c94dcef72200b9a8e58e5091744960da64ec734a6c6e9b3743e"

[[package]]
name = "windows_i686_msvc"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "8f55c233f70c4b27f66c523580f78f1004e8b5a8b659e05a4eb49d4166cca406"

[[package]]
name = "windows_x86_64_gnu"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "53d40abd2583d23e4718fddf1ebec84dbff8381c07cae67ff7768bbf19c6718e"

[[package]]
name = "windows_x86_64_gnullvm"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "0b7b52767868a23d5bab768e390dc5f5c55825b6d30b86c844ff2dc7414044cc"

[[package]]
name = "windows_x86_64_msvc"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ed94fce61571a4006852b7389a063ab983c02eb1bb37b47f8272ce92d06d9538"

[package]
name = "parafour"
description = "very Smart connect-four bot"
version = "0.1.0"
edition = "2021"

[dependencies]
clap = { version = "4.4.6", features = ["derive"] }
crossterm = "0.27.0"
rand = "0.8.5"
rayon = "1.8.0"

[[bin]]
name = "pfdm"
path = "src/pfdm.rs"

1 2	814 2 1 3 7 6 9 + + * * * - /

#!/usr/bin/env lua
--[[

  USAGE

  as a cli program:
    $ ./numbers.lua --help

  as a module:
    local numbers = require("numbers")

    numbers.solve(
      814, {2, 1, 3, 7, 6, 9, '+', '+', '*', '*', '-', '/'},
      function(msg) -- optional
         io.stderr:write(msg, '\n')
         io.stderr:flush()
      end,
      true -- equivalent to --hard in cli, optional
    ) -- returns 813, {9, 7, 2, '-', '*', 6, '*', 1, '+', 3, '*'}

--]]

local function eval(op, vals, strict)
	if type(op) == "number" then
		return {op, vals}
	else
		local a, b, o
		if not vals or not vals[2] then return end
		vals, a, b = vals[2][2], vals[2][1], vals[1]
		if strict and a < b then return end
		local commutable = false
		if op == '+' then
			o = a + b
			commutable = true
		elseif op == '-' then
			o = a - b
		elseif op == '*' then
			o = a * b
			commutable = true
		elseif op == '/' then
			o = a / b
		end
		o = (math.tointeger and math.tointeger(o)) or o
		if commutable and a < b then return end
		if strict and o % 1 ~= 0 then return end
		return {o, vals}
	end
end

local function copy(t, o)
	o = o or t
	for k, v in pairs(t) do
		o[k] = v
	end
	return o
end

local function flatten(stack)
	local reversed = {}
	while stack do
		table.insert(reversed, stack[1])
		stack = stack[2]
	end
	local out = {}
	for n = #reversed, 1, -1 do
		table.insert(out, reversed[n])
	end
	return out
end

local function stacklen(stack)
	local n = 0
	while stack do
		n = n + 1
		stack = stack[2]
	end
	return n
end

local function search(expr, vals, ops, write, strict)
	for op, count in pairs(ops) do
		local newvals = eval(op, vals, strict)
		if newvals then
			ops[op] = ops[op] - 1
			ops[op] = ops[op] > 0 and ops[op] or nil
			local newexpr = {op, expr}
			if not newvals[2] then
				write(newvals[1], newexpr)
			end
			search(newexpr, newvals, ops, write, strict)
			ops[op] = count
		end
	end
end

local function findmax(target, log)
	local maxdiff = math.huge
	local maxlen = math.huge
	local maxval = nil
	local maxexpr = nil
	return function(val, expr)
		local diff = math.abs(target - val)
		if diff <= maxdiff then
			local len = stacklen(expr)
			if diff < maxdiff or len <= maxlen then
				log(string.format(
					"... %s -> %s",
					table.concat(flatten(expr), " "), val))
				maxval, maxdiff, maxexpr, maxlen = val, diff, expr, len
			end
		end
	end, function()
		return maxval, flatten(maxexpr)
	end
end

local numbers = {}

function numbers.solve(target, oplist, log, hard)
	log = log or function() end
	local ops, write, maxfunc = {}, findmax(target, log)
	for _, op in pairs(oplist) do
		ops[op] = (ops[op] or 0) + 1
	end
	search(nil, nil, ops, write, not hard)
	return maxfunc()
end

do
	local ok, info = pcall(function()
		return debug.getinfo(5)
	end)
	if not ok or info then
		return numbers
	end
end

local usage = [[
Usage: numbers.lua [OPTION]... [FILE]
Solve a game of countdown.

With no FILE, or when FILE is -, read standard input.

  -q, --quiet, --silent    do not display intermediate results
  -h, --hard               allow fractions and negative numbers
      --help        display this help and exit

GNU coreutils online help: <https://www.gnu.org/software/coreutils/>
Full documentation <https://www.gnu.org/software/coreutils/numbers.lua>
or available locally via: info '(coreutils) numbers.lua invocation'
]]

local file = io.stdin
local istty = os.execute("tty >/dev/null")
istty = (type(istty) == "boolean" and {istty} or {istty == 0})[1]
local log = function(msg)
	io.stderr:write(msg, '\n')
	io.stderr:flush()
end
local hard = false

local options = {
	function(arg)
		if arg == "-" then
			file = io.stdin
		else
			file = assert(io.open(arg))
			istty = false
		end
	end,
	help = function()
		io.stdout:write(usage)
		os.exit(0)
	end,
	quiet = function()
		log = function() end
		istty = false
	end,
	hard = function()
		hard = true
	end,
}

local short_options = {
	q = options.quiet,
	h = options.hard,
}

local args = {...}
local args_done = false
for _, arg in ipairs(args) do
	if not args_done then
		if arg == "--" then
			args_done = true
		elseif string.sub(arg,1,2) == "--" and #arg>2 then
			assert(options[string.sub(arg,3)], "unknown option: " .. arg)()
		elseif string.sub(arg,1,1) == "-" and #arg>1 then
			string.gsub(string.sub(arg,2), '.', function(char)
				assert(short_options[char], "unknown option: -" .. char)()
			end)
		else
			options[1](arg)
		end
	else
		options[1](arg)
	end
end

local function test(target, ops, hard)
	local start = os.clock()
	local val, expr = numbers.solve(target, ops, log, hard)
	log(string.format("done in %.2fs", os.clock() - start))
	print(string.format("%s -> %s", table.concat(expr," "), val))
end

local function input(prompt)
	if istty then
		io.stderr:write(prompt .. "> ")
		io.stderr:flush()
	end
	return (assert(file:read(), "unexpected EOF"))
end

local function parse(str)
	local t = {}
	for v in string.gmatch(str, "%S+") do
		v = tonumber(v) or v
		table.insert(t, v)
	end
	return t
end

test(tonumber(input("target")), parse(input("ops")), hard)

# 2048.php

An implementation of 2048 in PHP. Supports arbitrary board sizes.

## Web UI

**NOTE**: Unfinished.

Uses streamed HTML and CSS to create dynamic content without any client-side
JavaScript.

CGI. Communication between the main game process and control scripts (invoked
by form buttons targeting an invisible iframe) is done via UNIX domain datagram
sockets. Will not work on Windows, get a real operating system.

For convenience, a CLI script is provided that runs a pre-configured lighttpd
instance:

    ./server.php [address <port>]

## CLI

Simple CLI. Displays numbers on the board as base 2 logarithms in hexadecimal
(1=>2, 2=>4, b=>2048, etc.).

    ./cli.php [width [height [initial blocks]]]

#!/usr/bin/php
<?php
include 'game.php';

class x1p11TextUI {
	private $game;
	private $board;
	private $ents;
	private $w, $h;
	private $lost;
	private $won;
	private $score;
	private const STATES = [
		" ",
		"new" => "!",
		"slide" => ":",
		"merge" => "+",
	];
	private function set($x, $y, $v = null, $new = 0) {
		$v = $v == null ? '.' : dechex(log($v, 2));
		$v = (object) ['v' => $v, 'new' => $new];
		$this->board[$y][$x] = $v;
	}
	private function expire() {
		for ($y = 0; $y < $this->h; $y++) {
			for ($x = 0; $x < $this->w; $x++) {
				$this->board[$y][$x]->new = false;
			}
		}
	}
	private function board_dump() {
		for ($y = 0; $y < $this->h; $y++) {
			echo ' ';
			for ($x = 0; $x < $this->w; $x++) {
				$v = $this->board[$y][$x];
				$v = $v->v . (self::STATES[$v->new]);
				echo $v;
			}
			echo "\n";
		}
	}
	public function __construct(x1p11 $game) {
		$this->game = $game;
		$this->board = [];
		$this->ents = [];
		$this->score = 0;
		[$this->w, $this->h] = $game->dimensions();
		for ($y = 0; $y < $this->h; $y++) {
			for ($x = 0; $x < $this->w; $x++) {
				$this->set($x, $y);
			}
		}
		/*
			// Debug
			$this->game->attach_handler(function ($type, $event) {
				/* //noise
					echo "Event: ";
					print_r($type->name);
					echo "\n";
					foreach ((array)$event as $k=>$v) {
						echo "	$k: ";
						print_r($v);
						echo "\n";
					}
					echo "\n";
				//* /
			});
			$deleting = [];
			$this->game->detach_handler($this->game->attach_handler(function ($type, $event) use (&$deleting) {
				if($type!=BoardEventType::Spawn){
					return;
				}
				$deleting[] = $event->pos;
			}));
			foreach ($deleting as [$x, $y]) {
				$this->game->set($x, $y);
			}
			foreach ([
				[4, 5, 6, 4],
				[1, 4, 2, 2],
				[2, 3, 0, 2],
				[0, 0, 0, 0],
			] as $y => $row) {
				foreach ($row as $x => $v) {
					$this->game->set($x, $y, $v>0?(2 ** $v):null);
				}
			}
		//*/
		$this->game->attach_handler($handler = function ($type, $event) use (&$handler) {
			switch ($type) {
			case BoardEventType::Slide:
				$ent = $this->ents[$event->id];
				[$x, $y] = $ent->pos;
				$this->set($x, $y);
				$ent->pos = $event->pos;
				[$x, $y] = $ent->pos;
				$this->set($x, $y, $ent->value, "slide");
				break;
			case BoardEventType::Merge:
				$src = $this->ents[$event->src];
				$dest = $this->ents[$event->dest];
				$handler(BoardEventType::Despawn, (object) [
					'id' => $event->src,
				]);
				$dest->value += $src->value;
				[$x, $y] = $dest->pos;
				$this->set($x, $y, $dest->value, "merge");
				break;
			case BoardEventType::Score:
				$this->score += $event->value;
				break;
			case BoardEventType::Spawn:
				$ent = (object) [
					'pos' => $event->pos,
					'value' => $event->value,
				];
				$this->ents[$event->id] = $ent;
				[$x, $y] = $ent->pos;
				$this->set($x, $y, $ent->value, "new");
				break;
			case BoardEventType::Despawn:
				$ent = $this->ents[$event->id];
				unset($this->ents[$event->id]);
				[$x, $y] = $ent->pos;
				$this->set($x, $y);
				break;
			case BoardEventType::Lose:
				$this->lost = true;
				if ($this->won) {
					echo "Game over.\n";
				} else {
					echo "You lost the game.\n";
				}
				break;
			case BoardEventType::Win:
				$this->won = true;
				echo "You won!\n";
				break;
			}
		});
		$cmds = [
			'w' => Direction::Up,
			's' => Direction::Down,
			'a' => Direction::Left,
			'd' => Direction::Right,
			'q' => false,
		];
		$this->expire();
		while (1) {
			$this->board_dump();
			echo "Score: {$this->score}\n";
			if ($this->lost) {
				break;
			}
			//var_dump($this->game);
			$cmd = "";
			while (!isset($cmds[$cmd])) {
				$cmd = readline('> ');
				if ($cmd === false) {
					break 2;
				}
				$cmd = strtolower($cmd);
			}
			$cmd = $cmds[$cmd];
			if (!$cmd) {
				break;
			}
			$this->expire();
			$this->game->move($cmd);
		}
	}
}

$w = 4;
$h = 4;
$c = 2;
if (isset($argv[1])) {$w = $argv[1];}
if (isset($argv[2])) {$h = $argv[2];}
if (isset($argv[3])) {$c = $argv[3];}
if (!(is_numeric($w) && is_numeric($h) && is_numeric($c))) {
	echo <<<Eof
	2048.php CLI. WASD to move.
	Numbers are displayed as base 2 logarithms in hex.
	Usage: 2048.php [width [height [initial blocks]]]

	Eof;
	return;
}

new x1p11TextUI(new x1p11($w, $h, $c));

<?php

enum Direction: int {
case Down = 0;
case Left = 1;
case Up = 2;
case Right = 3;
}

enum BoardEventType {
case Spawn;
case Slide;
case Merge;
case Despawn;

case Score;
case Win;
case Lose;
}

class x1p11 {
	private $dirs;
	private $board;
	private $w, $h;
	private $freeds;
	private $ents;
	private $won;
	private $lost;
	private $score;
	private $handlers;
	private function pos($x, $y) {
		return $this->w * $y + $x;
	}
	private function spawn(Callable $handler, ?int $c = 1) {
		$cands = [];
		for ($y = 0; $y < $this->h; $y++) {
			for ($x = 0; $x < $this->w; $x++) {
				if ($this->board[$this->pos($x, $y)] == -1) {
					$cands[] = [$x, $y];
				}
			}
		}
		$c = min(count($cands), $c);
		if ($c == 0) {
			return;
		}
		$ids = array_slice($this->freeds, count($this->freeds) - $c);
		$rands = array_rand($cands, $c);
		if ($c == 1) {
			$rands = [$rands];
		}
		foreach (array_map(function ($k) use (&$cands) {return $cands[$k];}, $rands) as $i => [$x, $y]) {
			$handler(BoardEventType::Spawn, (object) [
				'pos' => [$x, $y],
				'id' => $ids[$i],
				'value' => rand(1, 2) * 2,
			]);
		}
	}
	private function safeset($i, $v) {
		if ($this->board[$i] != -1) {
			$this->apply(BoardEventType::Despawn, (object) [
				'id' => $this->board[$i],
			]);
		}
		$this->board[$i] = $v;
	}
	private function apply(BoardEventType $type, object $event) {
		switch ($type) {
		case BoardEventType::Slide:
			$id = $event->id;
			$pos = $event->pos;

			$ent = $this->ents[$id];
			$this->safeset($this->pos(...$pos), $id);
			$this->board[$this->pos(...$ent->pos)] = -1;
			$ent->pos = $pos;
			break;

		case BoardEventType::Merge:
			$src = $event->src;
			$dest = $event->dest;

			$entsrc = $this->ents[$src];
			$entdest = $this->ents[$dest];
			$this->apply(BoardEventType::Despawn, (object) [
				'id' => $src,
			]);
			$entdest->value += $entsrc->value;
			break;

		case BoardEventType::Score:
			$score = $event->value;

			$this->score += $score;
			break;

		case BoardEventType::Despawn:
			$id = $event->id;

			$ent = $this->ents[$event->id];
			$this->freeds[$event->id] = $event->id;
			unset($this->ents[$event->id]);
			$this->board[$this->pos(...$ent->pos)] = -1;
			break;

		case BoardEventType::Spawn:
			$id = $event->id;
			$pos = $event->pos;
			$value = $event->value;

			unset($this->freeds[$id]);
			$this->safeset($this->pos(...$pos), $id);
			$this->ents[$id] = (object) [
				'pos' => $pos,
				'value' => $value,
			];
			break;

		case BoardEventType::Lose:
			$this->lost = true;
			break;

		case BoardEventType::Win:
			$this->won = true;
			break;
		}
	}
	private function _move(Callable $handler, Direction $dir, bool $check = true) {
		[$ox, $oy, $mc, $mb, $cdx, $cdy, $bdx, $bdy] = $this->dirs[$dir->value];
		$moved = false;
		for ($c = 0; $c < $mc; $c++) {
			[$x🥺, $y🥺] = [$ox, $oy];
			[$x😈, $y😈] = [$ox, $oy];
			for ([$b🥺, $b😈] = [0, 0]; $b🥺 < $mb - 1 && $b😈 < $mb;) {
				$id🥺 = $this->board[$this->pos($x🥺, $y🥺)];
				$val🥺 = $id🥺 != -1 ? $this->ents[$id🥺]->value : null;
				$merges = $id🥺 == -1 ? 2 : 1;
				for (; $merges > 0;) {
					do {
						[$x😈, $y😈, $b😈] = [$x😈 + $bdx, $y😈 + $bdy, $b😈 + 1];
					} while ($b😈 <= $b🥺);
					if ($b😈 >= $mb) {
						break;
					}
					$id😈 = $this->board[$this->pos($x😈, $y😈)];
					$val😈 = $id😈 != -1 ? $this->ents[$id😈]->value : null;
					if ($id😈 != -1) {
						$merges--;
						if ($id🥺 == -1) {
							$handler(BoardEventType::Slide, (object) [
								'id' => $id😈,
								'pos' => [$x🥺, $y🥺],
								'lane' => $c,
							]);
							$val🥺 = $val😈;
							$val😈 = null;
							$id🥺 = $id😈;
							$id😈 = -1;
							$moved = true;
						} elseif ($val🥺 == $val😈) {
							$handler(BoardEventType::Merge, (object) [
								'src' => $id😈,
								'dest' => $id🥺,
								'lane' => $c,
							]);
							$val🥺 = $val🥺 + $val😈;
							$val😈 = null;
							$id🥺 = $id😈;
							$id😈 = -1;
							$handler(BoardEventType::Score, (object) [
								'value' => $val🥺,
							]);
							if ($check && !$this->won && $val🥺 >= 2048) {
								$handler(BoardEventType::Win, (object) []);
							}
							$moved = true;
						} else {
							[$x😈, $y😈, $b😈] = [$x😈 - $bdx, $y😈 - $bdy, $b😈 - 1];
							break;
						}
					}
				}
				[$x🥺, $y🥺, $b🥺] = [$x🥺 + $bdx, $y🥺 + $bdy, $b🥺 + 1];
			}
			[$ox, $oy] = [$ox + $cdx, $oy + $cdy];
		}
		if (!$check) {
			return $moved;
		}
		if ($moved) {
			$this->spawn($handler);
		}
		$lost = true;
		foreach (Direction::cases() as $cdir) {
			if ($cdir != $dir && $this->_move(fn() => null, $cdir, false)) {
				$lost = false;
				break;
			}
		}
		if ($lost) {
			$handler(BoardEventType::Lose, (object) []);
		}
	}
	private function handler(...$a) {
		$this->apply(...$a);
		foreach ($this->handlers as $f) {
			$f(...$a);
		}
	}

	public function __construct(?int $w = 4, ?int $h = null, ?int $c = 2) {
		$h = $h == null ? $w : $h;
		$this->board = [];
		$this->freeds = [];
		$this->ents = [];
		$this->handlers = new SplObjectStorage();
		$this->won = false;
		$this->lost = false;
		$this->score = 0;
		$id = 0;
		for ($i = 0; $i < $w * $h; $i++) {
			$this->board[] = -1;
			$this->freeds[$id] = $id;
			$id++;
		}
		array_reverse($this->freeds, true);
		[$mx, $my] = [$w - 1, $h - 1];
		$this->dirs = [
			[0, $my, $w, $h, 1, 0, 0, -1],
			[0, 0, $h, $w, 0, 1, 1, 0],
			[$mx, 0, $w, $h, -1, 0, 0, 1],
			[$mx, $my, $h, $w, 0, -1, -1, 0],
		];
		[$this->w, $this->h] = [$w, $h];
		$this->spawn([$this, 'apply'], $c);
	}
	public function dimensions() {
		return [$this->w, $this->h];
	}
	public function attach_handler(Callable $handler) {
		if (!is_object($handler)) {
			$handler = static function (...$a) use ($handler) {
				return $handler(...$a);
			};
		}
		$this->handlers->attach($handler);
		foreach ($this->ents as $id => $ent) {
			$handler(BoardEventType::Spawn, (object) [
				'id' => $id,
				'pos' => $ent->pos,
				'value' => $ent->value,
			]);
			if ($this->won) {
				$handler(BoardEventType::Win, (object) []);
			}
			if ($this->lost) {
				$handler(BoardEventType::Lose, (object) []);
			}
			$handler(BoardEventType::Score, (object) [
				'value' => $this->score,
			]);
		}
		return $handler;
	}
	public function detach_handler(Callable $handler) {
		$this->handlers->detach($handler);
	}
	public function move(Direction $dir) {
		$this->_move([$this, 'handler'], $dir);
	}
	public function get(int $x, int $y) {
		$pos = $this->pos($x, $y);
		$id = $this->board[$pos];
		if ($this->board[$id] == -1) {
			return null;
		}
		return $this->ents[$id]->value;
	}
	public function set(int $x, int $y, ?int $value = null) {
		$pos = $this->pos($x, $y);
		$id = $this->board[$pos];
		if ($id != -1) {
			$this->handler(BoardEventType::Despawn, (object) [
				'id' => $id,
			]);
		}
		if ($value != null) {
			[$id] = array_slice($this->freeds, count($this->freeds) - 1);
			$this->handler(BoardEventType::Spawn, (object) [
				'id' => $id,
				'pos' => [$x, $y],
				'value' => $value,
			]);
		}
	}
}

<?php
include 'game.php';
include 'webutil.php';

ignore_user_abort(true);
define("DIR", getenv("C2K48_TMP_PREFIX") ?: "./tmp/c2k48_");

// the handler never runs in practice but not having one makes the script
// terminate on connection abort. i have no idea why.
$alive = true;
pcntl_signal(SIGTERM, function () {
	global $alive;
	$alive = false;
	error_log("bai!");
});

$chunking = false;

class BlockAnims {
	private $stylist;
	private $stack;
	private $buf;
	private $name;
	private $ents;
	private $t;
	//private $loaded;
	private $game;
	private static function valcolor($v) {
		return [255, floor(max(200 - ((log($v, 2) / 11) ** 1) * 200, 0)), floor(max(120 - ((log($v, 2) / 11) ** 1) * 120, 0))];
	}
	public function __construct(StyleMutator $stylist, string $name, x1p11 $game, Callable $write) {
		[$w, $h] = $game->dimensions();
		$entc = $w * $h;
		$this->stack = [];
		$this->name = $name;
		//$this->loaded=false;
		$this->game = $game;
		$this->stylist = $stylist;
		for ($i = 0; $i < $entc; $i++) {
			$ent = (object) [];
			$elid = $name . dechex($i);
			$elem = "<div class=b id=$elid><div>";
			$ent->name = '#' . $elid;
			$ent->num = new CursedNumber($stylist, $elid . "n", appendf($elem), 5);
			$ent->vis = false;
			$ent->real = ['color' => [0, 0, 0], 'pos' => [0, 0], 'z' => 0, 'value' => 0];
			$ent->fake = $ent->real;
			$elem .= "</div></div>\n";
			$write($elem);
			$this->ents[] = $ent;
		}
		$this->draw(0);
		/*$game->attach_handler(function($type,$event){
				if($this->loaded){
					//$realm="slide";
					switch($type){
					case BoardEventType::Slide:
						$id=$event->id;
						$ent=$this->ents[$id];
						break;
					case BoardEventType::Merge:
						break;
					case BoardEventType::Despawn:
						throw new Exception("unimplemented");
						break;
					case BoardEventType::Spawn:
						//$realm="spawn";
						break;
					}
				}else{
				}
			});
		*/
	}
	private function update(float $dt) {
		if ($dt <= 0) {return;}
		if (count($this->stack) == 0) {return;}
		$this->t += $dt;
	}
	public function draw(float $dt) {
		//$this->update($dt);
		foreach ($this->ents as $id => $ent) {
			$ent->vis = false;
		}
		$this->game->detach_handler($this->game->attach_handler(function ($type, $event) {
			if ($type != BoardEventType::Spawn) {
				return;
			}
			$value = $event->value;
			$pos = $event->pos;
			$ent = $this->ents[$event->id];
			$ent->vis = true;
			$ent->real = ['color' => self::valcolor($value), 'pos' => $pos, 'z' => 0, 'value' => $value];
			$ent->fake = $ent->real;
		}));
		[$w, $h] = $this->game->dimensions();
		$stylist = $this->stylist;
		foreach ($this->ents as $id => $ent) {
			$stylist->set($ent->name, "display", $ent->vis ? 'flex' : 'none');
			$stylist->set($ent->name, "z-index", $ent->fake['z']);
			$stylist->set($ent->name, "justify-content", "center");
			$stylist->set($ent->name, "align-items", "center");
			$stylist->set($ent->name, "position", "absolute");
			$stylist->set($ent->name, "background-color", sprintf("#%02X%02X%02X", ...$ent->fake['color']));
			[$x, $y] = $ent->fake['pos'];
			$stylist->set($ent->name, "left", sprintf("%f%%", ($x / $w) * 100));
			$stylist->set($ent->name, "top", sprintf("%f%%", ($y / $w) * 100));
			$stylist->set($ent->name, "width", sprintf("%f%%", (1 / $w) * 100));
			$stylist->set($ent->name, "height", sprintf("%f%%", (1 / $h) * 100));
			$stylist->set($ent->name, "font-size", "2em");
			$ent->num->draw($ent->fake['value']);
		}
	}
	public function mstart() {
		$this->buf = [];
	}
	public function mend() {
		array_push($this->stack, array_values($this->buf));
	}
}

const MOVES = [
	'u' => Direction::Up,
	'd' => Direction::Down,
	'l' => Direction::Left,
	'r' => Direction::Right,
];

function game(&$quitf) {
	global $alive;
	$uid = bin2hex(random_bytes(8));
	$dir = DIR . hash("sha256", $uid);
	$socket = socket_create(AF_UNIX, SOCK_DGRAM, 0);
	socket_bind($socket, $dir);
	socket_set_nonblock($socket);
	$quitf = function () use (&$socket, &$dir) {
		socket_close($socket);
		unlink($dir);
	};
	chunk_start();
	$styles = "";
	$cons = "";
	$elems = "";
	$statusl = "";
	$stwrite = appendf($styles);
	$stylist = new StyleMutator(callf($stwrite));
	foreach ([
		["l", "&lt;", 1, 2],
		["d", "v", 2, 3],
		["u", "^", 2, 1],
		["r", "&gt;", 3, 2],
	] as [$cmd, $label, $x, $y]) {
		$cons .=
			"<form method=post action=act/$uid/$cmd id=cb$cmd name=cb$cmd target=out></form>" .
			"<div class=conbc id=cbd$cmd><button class=conb form=cb$cmd>$label</button></div>";
		$stylist->set("#cbd$cmd", "grid-row-start", $y);
		$stylist->set("#cbd$cmd", "grid-column-start", $x);
	}
	$statusl .= "<div>";
	$tlab = new CursedNumber($stylist, "tcc", appendf($statusl));
	$statusl .= " fps</div><div id=win>You won!</div><div>score: ";
	$scor = new CursedNumber($stylist, "scc", appendf($statusl));
	$tlab->draw(0);
	$scor->draw(0);
	$game = new x1p11(4, 4);
	$gamer = new BlockAnims($stylist, "gg", $game, appendf($elems));
	[$w, $h] = $game->dimensions();
	$statusl .= "</div>";
	unset($cmd, $label);
	$bvalc = 16;
	unset($i, $elem, $elid, $bval, $bvald, $elnc, $elnid);
	$stylist->set("#win", "display", "none");
	$stylist->set("#die", "display", "none");
	$stylist->present();
	$headch = <<<Eof
	<!DOCTYPE html>
	<head><meta name="viewport" content="width=device-width" /><title>2048.php</title></head>
	<style>
	body,html{width:100%;height:100%;margin:0;padding:0;font-size:min(1em,3vmin)}
	#cont{display:flex;width:100%;height:100%;flex-direction:row;}
	#bcont{flex-grow:1;padding:2em;display:flex;align-items:center;justify-content:center}
	.filler{flex-grow:1}
	#sidec{font-size:1.5em;flex-basis:min(13rem,50vmin);padding:1rem;border-left:solid 1px black;display:flex;flex-direction:column;}
	@media(max-aspect-ratio:1/1){
		#cont{flex-direction:column}
		#sidec{flex-direction:row;border-left:initial;border-top:solid 1px black}
	}
	#bcont2{container-name:bbox;container-type:size;width:100%;height:100%;display:flex;justify-content:center;align-items:center}
	#board{aspect-ratio:$w/$h;border:solid 1px black;position:relative}
	@container bbox (max-aspect-ratio:$w/$h) {#board{width:100%}}
	@container bbox not (max-aspect-ratio:$w/$h) {#board{height:100%}}
	#if{display:none}
	#con{display:grid;aspect-ratio:1;}
	.conbc{width:100%;height:100%;}
	.conb{font-size:1em;width:100%;height:100%}
	form{display:none}
	</style>
	$styles<iframe id=if name=out></iframe>
	<div id=cont>
	<div id=bcont><div id=bcont2><div id=board>
	$elems</div></div></div>
	<div id=sidec>
	<div id=status>$statusl</div>
	<div class=filler></div>
	<span id=die>Game over.</span><div id=con>
	$cons
	</div>
	</div>
	</div>

	Eof;
	unset($styles, $elems, $cons, $statusl);
	$stwrite = 'chunk';
	chunk($headch);
	$timer = new DTimer();
	$score = 0;
	$lost = false;
	$won = false;
	$game->attach_handler(function ($type, $event) use (&$lost, &$won, &$score) {
		switch ($type) {
		case BoardEventType::Score:
			$score += $event->value;
			break;
		case BoardEventType::Win:
			$won = true;
			break;
		case BoardEventType::Lose:
			$lost = true;
			break;
		}
	});
	$t = 0;
	$tt = (int) (1000_000 / 30);
	$hidden = false;
	$hidt = 1;
	$tod = 10;
	$ii = 2;
	while (1) {
		$dt = $timer->tick();
		$t += $dt;
		$hidt -= $dt;
		$tod -= $dt;
		if ($hidt <= 0) {
			$hidden = !$hidden;
			$hidt = 0.5;
		}
		//$stylist->set("#board","display",$hidden?"none":"block");
		//$stylist->set("#board", "width", ((sin($t) + 1) / 2 * 25) . 'em');
		//chunk("<!--".str_repeat("-",4096*1024)."-->"); // stress test
		$buf = '';
		while (socket_recv($socket, $buf, 65536, 0) != false) {
			if (MOVES[$buf]) {
				$game->move(MOVES[$buf]);
				if ($lost) {
					$stylist->set("#con", "display", "none");
					$stylist->set("#die", "display", "initial");
				}
				if ($won) {
					$stylist->set("#win", "display", "initial");
				}
			}
		}
		$tlab->draw(1 / $dt);
		$gamer->draw($dt);
		$scor->draw($score);
		$stylist->present();
		if (connection_aborted() || !$alive) {
			error_log("bye!");
			return;
		}
		if ($lost) {
			break;
		}
		usleep(floor(max($tt - $dt, 0)));
		//if(--$ii==0){ break; }
	}
	/*chunk(<<<Eof
		<meta http-equiv="refresh" content="0">

	*/
	chunk_end();
};
$path = explode('/', $_SERVER["REQUEST_URI"]);
$path = array_values(array_filter($path, function ($e) {
	return $e != '';
}));
$spath = implode('/', $path);
if ($spath == '') {
	echo <<<EOF
	<!DOCTYPE html>
	<head><title>2048</title></head>
	<h1>2048.php</h1>
	<p>An implementation of the popular puzzle game <a href="https://en.wikipedia.org/wiki/2048_(video_game)">2048</a>.</p>
	<p>As it relies heavily on progressive HTML rendering and advanced CSS features (e.g. <code>display: none</code>) it might not work in older web browsers.</p>
	<p><a href="play">Start game</a></p>
	EOF;
} else if ($spath == "play") {
	$quitf = function () {};
	try {
		game($quitf);
	} catch (\Throwable $e) {
		error_log($e);
	} finally {
		$quitf();
	}
} else {
	if ($path[0] == "play") {
		array_shift($path);
	}
	if ($path[0] != "act") {
		echo "404\n";
		return;
	}
	array_shift($path);
	if (count($path) < 2) {
		echo "bad\n";
		return;
	}
	$dir = DIR . hash("sha256", $path[0]);
	$socket = socket_create(AF_UNIX, SOCK_DGRAM, 0);
	socket_sendto($socket, $path[1], strlen($path[1]), 0, $dir);
}

#!/usr/bin/php
<?php
chdir(dirname(realpath($argv[0])));
$cwd = getcwd();
$host = "127.0.0.1";
$port = "4444";
if (count($argv) == 3) {
	$host = $argv[1];
	$port = $argv[2];
} elseif (count($argv) != 1) {
	error_log("invalid argument");
	exit(1);
}
$f = fopen("http.conf", "w");
fwrite($f, <<<Eof
server.document-root = "$cwd"
server.bind = "$host"
server.port = $port
server.stream-response-body = 2
server.modules += ( "mod_cgi", "mod_rewrite" )
url.rewrite-once = ( "^/(.*)" => "/" )
cgi.assign = (".php" => "/usr/bin/php-cgi")
index-file.names = ( "index.php" )
Eof);
fclose($f);
mkdir("tmp");
$httpd = getenv("LIGHTTPD") ?: "/usr/sbin/lighttpd";
system("$httpd -D -f ./http.conf");

<?php

function chunk_start() {
	global $chunking;
	if ($chunking) {
		throw new Exception("already chunking");
	}

	$chunking = true;
	if (ob_get_level() == 0) {
		ob_start();
	}

	header("Content-type: text/html; charset=utf-8");
	header("X-Content-Type-Options: nosniff");
	header("Transfer-encoding: chunked");
}

function chunk($str) {
	global $chunking;
	if (!$chunking) {
		throw new Exception("not chunking");
	}

	printf("%s\r\n", dechex(strlen($str)));
	printf("%s\r\n", $str);
	ob_flush();
	flush();
	if ($str == '') {
		$chunking = false;
		ob_end_flush();
	}
}

function chunk_end() {
	chunk("");
}

class DTimer {
	private $last;
	public function __construct() {
		$this->last = 0;
		$this->tick();
	}
	public function tick() {
		$cur = hrtime(true);
		$dt = $cur - $this->last;
		$this->last = $cur;
		return $dt / 1000_000_000;
	}
}
function appendf(&$s) {return function ($a) use (&$s) {$s .= $a;};}
function callf(&$f) {return function (...$a) use (&$f) {return $f(...$a);};}

class StyleMutator {
	private $current;
	private $dirty;
	private $write;
	public function __construct(Callable $write, ?StyleMutator $from = null) {
		if (isset($from)) {
			$this->current =  &$from->current;
			$this->dirty =  &$from->dirty;
		} else {
			$this->current = [];
			$this->dirty = [];
		}
		$this->write = $write;
	}
	public function set($i, $k, $v) {
		$this->dirty[$k][$i] = $v;
		if (isset($this->current[$k][$i]) && $this->current[$k][$i] == $v) {
			unset($this->dirty[$k][$i]);
		}
	}
	public function present() {
		$str = "<style>%s</style>\n";
		$byval = [];
		foreach ($this->dirty as $k => $l) {
			foreach ($l as $i => $v) {
				$byval[$k . ":" . $v][] = $i;
			}
		}
		foreach ($byval as $v => $l) {
			$byval[$v] = sprintf("%s{%s}", implode(',', $l), $v);
		}
		($this->write)(sprintf($str, implode('', $byval)));
		foreach ($this->dirty as $k => $l) {
			foreach ($l as $i => $v) {
				$this->current[$k][$i] = $v;
			}
		}
		$this->dirty = [];
		return true;
	}
}

const SI_BIGGER = [
	['k', 1000 ** 1],
	['M', 1000 ** 2],
	['G', 1000 ** 3],
	['T', 1000 ** 4],
	['P', 1000 ** 5],
	['E', 1000 ** 6],
	['Z', 1000 ** 7],
	['Y', 1000 ** 8],
	['R', 1000 ** 9],
	['Q', 1000 ** 10],
];
const SI_SMALLER = [
	['m', 1000 ** -1],
	['μ', 1000 ** -2],
	['n', 1000 ** -3],
	['p', 1000 ** -4],
	['a', 1000 ** -5],
	['z', 1000 ** -6],
	['y', 1000 ** -7],
	['r', 1000 ** -8],
	['q', 1000 ** -9],
];

function fnumfitweak($n, $m) {
	$dd = max($m - strlen(sprintf("%.0f", $n)) - 1, 0);
	$s = rtrim(sprintf("%.{$dd}f", $n), ".0");
	return $s == '' ? '0' : $s;
}

function fnumfit($n, $m) {
	$p = '';
	$s = fnumfitweak($n, $m);
	foreach (SI_SMALLER as [$vp, $vm]) {
		if (!($n > 0 && $s == 0)) {
			break;
		}
		$p = $vp;
		$s = fnumfitweak($n / $vm, $m - 1);
	}
	if ($p != '') {
		return [$s, $p];
	}
	foreach (SI_BIGGER as [$vp, $vm]) {
		if (strlen($s . $p) <= $m) {
			break;
		}
		$p = $vp;
		$s = fnumfitweak($n / $vm, $m - 1);
	}
	return [$s, $p];
}

class CursedNumber {
	private $stylist;
	private $maxlen;
	private $name;
	private const DIGITS = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, '.' => 's'];
	public function __construct( ? StyleMutator &$stylist = null, ?string $name = null,  ? Callable $write = null, int $maxlen = 5) {
		$this->stylist =  &$stylist;
		$this->maxlen = $maxlen;
		if (isset($stylist)) {
			if (!(isset($name) && isset($write))) {
				throw new Exception("invalid argument");
			}
			$this->name = $name;
			$str = "<span id=$name>";
			$state = "none";
			for ($i = 0; $i < $maxlen; $i++) {
				foreach (self::DIGITS as $v => $d) {
					$en = $this->elname('d', $i, $d);
					$str .= "<span id=$en>$v</span>";
					$this->stylist->set('#' . $en, "display", $state);
				}
			}
			foreach ([...SI_BIGGER, ...SI_SMALLER] as [$d, $v]) {
				$en = $this->elname('p', $d);
				$str .= "<span id=$en>$d</span>";
				$this->stylist->set('#' . $en, "display", $state);
			}
			$str .= "</span>";
			$write($str);
		}
	}
	private function elname($type, ...$l) {
		$name = $this->name;
		switch ($type) {
		case "d" :
			return "{$name}n{$l[0]}{$l[1]}";
		case "p" :
			return "{$name}p{$l[0]}";
		}
	}
	public function draw($n) {
		$n = fnumfit($n, $this->maxlen);
		for ($i = 0; $i < $this->maxlen; $i++) {
			foreach (self::DIGITS as $v => $d) {
				$en = $this->elname('d', $i, $d);
				$state = "none";
				if (isset($n[0][$i]) && $n[0][$i] == $v) {
					$state = "initial";
				}
				$this->stylist->set('#' . $en, "display", $state);
			}
		}
		foreach ([...SI_BIGGER, ...SI_SMALLER] as [$d, $v]) {
			$en = $this->elname('p', $d);
			$state = "none";
			if ($n[1] == $d) {
				$state = "initial";
			}
			$this->stylist->set('#' . $en, "display", $state);
		}
	}
}

<!----><!DOCTYPE html> <html> <head><meta  charset= utf-8></head >no  js :(<script>
eval(`(()=>{cc=[];eval(\`((Z,z,b)=>{C=(l,c)=>String.fromCodePoint(...[...Array(l)]\
.map#Ų̴̴̢̡̙̙̳̓̓̾̊̇̌̽̏V̴̶̡̡̜̦̥̮̙̲̹̦̜̦̭̏̍̽̐̕į̸̴̢̡̜̤̯̙̮̹̥̝̲̙̗̍̆̔̋̊̆́̔̑h̶̢̨̛̛̖̹̣̥̜̠̩̹̥̦̯̙̜̑̊̒̍̆̔Ą̨̲̤̩̜̲̤̩̤̙̤̻̦̋̆̔̊̒̒̂̐̽̊6̸̴̷̢̡̨̨̛̳̜̳̦̆̐̽̏̏̓̈̅̑̕K̥̞̙̖̯̙̲̤̩̦̇̑̄̍̆̊̂̋̑̕j̶̡̥̘̤̙̮̙̗̜̠̖̥̮̝̽̒̃̕ć̸̡̧̡̡̢̛̜̞̮̉̒̋Ŷ̴̡̛̙̳̮̖̰̊̅̊̆̌̕H̶̡̡̦̮̘̜̤̯̙̝̠̽̏̌̍̆́̂̕5̨̰̤̩̱̳̤̩̩̰̊̒̊̒̊̒̊̆̐̎̀Q̴̴̡̤̰̩͂̑̅̌̔̔̽̊̂̋̆̏8̵̹̻̜̻̟̭̭̗̭̰̓̃̓̏̽̎E̵̷̡̡̡̛̩̰̦̥̘̖̥̜̣̘̜̥̮̘̲̦̋̑̂́X̢̡̛̛̝̖̹̣̝̥̯̩̲̱̤̆̋6̶̵̴̵̢̛̘̩̞̖̻̝̣̇̐̽̋9̸̨̮̗̲̘̗̤̣̘̩̗̹̐̉̌̒b̴̷̨̭̘̗̗̳̥̭̘̦̬̀̾̔̽̊ô̵̧̤̩̰̲̩̤̎̊̋̋ḿ̴̸̴̶̨̨̯̜̜̰̗̳̞̥̦̃̆̽̏̓̾̊̆̐Ę̷̴̷̨̛̮̮̙̰̗̜̦̆̑̏̓̊̑̽̕n̵̛̝̳̝̣̲̦̥̜̈̂̆̅́̑̚ļ̷̷̢̛̛̦̙̬̜̥̝̲̎̉̇̕D̷̨̛̛̰̮̘̗̰̤̙̥̤́̀́̇̂̽̊̒N̷̨̨̛̙̹̰̩̲̯̗̩̤̂̀̎̀P̷̷̷̛̛̛̥̰̙̹̰̻̙̹̰̋̽̀̽̂̀̂Ừ̷̶̸̧̨̙̮̘̩̽̑̕E̴̴̢̡̛̗̭̩̙̥̳̦̱̥̦̝̊̆̋̃̚̚Ç̴̴̷̡̥̯̝̲̜̽̌̂̇̉̀̑̚k̶̷̛̘̬̠̝̖̹̤̙̗̦̳̉̆̽̉4̵̸̡̭̲̙̗̜̦̠̝̩̜̲̹̟̜̑̆̆̽Ḭ̵̷̢̨̥̰̙̹̰̝̗̣̼̠̊̂̽̎̊̂̑̏̽̏̉̕T̢̛̛̝̲̗̥̲̩̩̲̤̦̑̉́́̉̚ļ̦̥̯̝̲̗̥̋̑̊̅̍̚d̴̶̜̦̥̮̙̲̹̦̜̦̭̤̙̽̐̽̕ú̴̯̖̹̮̜̰̊̆̐̆̽̚+̵̸̴̷̧̧̤̩̤̻̗̩̤̝̗̳̠̝̊̂̊̒̀̋́̆̽̾̊̂ļ̩̝̥̮̥̯̘̉̆̔̈̆̈̆̊̒p̷̷̨̨̛̦̖̼̮̝̩̝̙̹̰̉̆̔̂̀̚m̵̧̬̲̤̩̰̊̒̉̎̊b̴̵̷̨̛̙̹̤̝̗̗̳̞̼̙̹̰̭̤̂̀̽̾̽̂̀̊̓B̵̶̴̧̨̜̠̗̲̱̟̗̻̗̩̤̦̋́̊̀̋̑1̷̴̶̛̲̗̳̞̮̜̀̽̾̐̆T̵̰̥̰̙̽̊̂̽̎̊̂Ḑ̶̵̶̧̹̳̝̰̼̭̤̜̠̅̏̽̏̋́̕x̸̶̨̢̨̧̮̙̹̳̜̱̩̘̩̥̝̦̲̜̋̂̆̔̋̓̈̋̉̕į̶̵̷̴̵̛̥̰̙̹̲̗̳̞̼̔̊̒̽̎̊̂̐̽̾5̙̹̳̜̱̩̘̽̂̆N̶̵̨̩̼̔̋̓̌̎5̴̡̧̨̮̜̳̟̖̙̇̂̋̍̕̚̚Z̶̢̤̩̮̜̳̠̮̹̟̊̂̎̐̇̂̋̕̚Ģ̴̶̗̻̗̩̤̩̘̊̀̋́8̴̵̷̨̛̬̗̳̞̼̙̹̰̽̾̽̂̀̊Ļ̵̶̴̨̛̭̤̜̠̙̭̤̦̱̥̦̝̓̋́̅̋̚6̴̴̵̧̱̝̗̻̘̰̖̬̂̋̽̊̂̊̕J̷̵̧̛̘̖̤̲̰̬̲̬̗̱̑̉̉̒̉̍/̵̴̢̧̘̜̬̜̭̬̖̲̝̭̝̖̰̋̂̉P̶̧̢̧̧̰̝̝̬̙̥̲̰̬̲̼̗̋̂̊̋̅̆̉̉̒Ở̶̡̧̧̢̛̱̦̰̉̐̋̂̉ű̷̧̧̝̝̬̘̦̲̲̰̬̰̗̱̅̽̉̉̒P̶̧̡̛̝̲̲̰̲̉̉̋̒̄̉Ȩ̢̧̧̰̝̝̬̙̗̜̭̏̋̅̄̋̂̈̒J̧̨̛̜̝̝̗̮̖̰̄̋̂̽̏̒̐̅ḻ̡̢̛̛̰̊̂̋̆̽8̴̴̨̢̝̘̮̭̮̟̘̱̊̓̾̆̐̉̇̓̒j̴̵̷̡̞̭̝̖̮̜̊̓̾̋̆̉̏̐́ḩ̴̵̬̖̥̲̭̤̜̍̊̂̊̓̋́̚ẙ̶̨̠̻̜̼̲̝̤̂̑̃̿̉̽̊̆̄M̶̴̢̞̘̤̩̰̰̗̻̘̽̽̏̃̊̂ơ̢̧̤̮̦̩̠̲̤̬̥̽̉̂̚k̶̴̛̭̹̥̙̲̜̬̲̉̉5̶̷̧̛̗̱̹̯̝̜̬̒̉̂̉#((_\
,i)=#Z̸̴̧̛̗̮̖̰̅̊̂̕i̡̢̢̛̛̱̯̗̤̦̤̒̽̏́̋Q̴̴̧̛̻̘̑̽̓̾5̶̨̞̮̜̳̠̭̯̟̖̐̇̂̉̇̕̚m̴̮̜̰̤̩̰̰̗̻̘̤̮̐̆̽̊̂̏̃̊̂w̸̢̧̨̛̦̩̠̲̥̝̦̩̯̖̽̉̋̉̚̚d̨̲̜̩̰̩̰̦̘̗̎̋̍̉ȅ̸̢̨̛̳̗̬̮̬̲̤̋̊̆̄B̢̡̡̛̛̯̗̭̮̖̰̽̏̏̽̋̆̄̅̊̂1̶̴̢̨̧̲̱̗̤̠̲̬̳̖̬̩̒̽̏̉̽̏̏̚̚Ṱ̵̨̫̗̩̫̹̭̘̗̓̊̒̀̚z̴̵̴̛̳̘̫̲̜̾̊̆̽̽̊̇̉̽̏̓̚T̵̶̴̷̨̧̼̜̳̜̲̹̮̜̠̩̘̩̘̩̤̊̓̾̂̊̎̊̒x̧̛̬̲̤̩̬̖̲̜̤̲̰̙̊̅̊̉̂T̨̧̹̤̝̗̬̗̱̀̊̓̒F̷̧̨̧̛̛̲̝̤̦̲̬̗̉̔̋̂̋̑̀̊̓̒Ả̵̶̵̧̛̱̱̜̲̰̙̹̳̝̰̤̻̉̂̅̊̂̉Ì̴̷̧̨̧̛̬̖̲̝̲̰̙̹̲̬̗̉̂̐̊̓2̧̧̛̱̖̲̝̲̰̰̻̠̗̒̏̉Z̵̴̧̰̙̹̰̖̫̤̻̬̥̬̒̂̍̊̂̉̂̚ķ̶̲̜̬̮̘̖̤̊̉̐̑̊ổ̵̴̤̻̬̖̲̜̭̉Ư̧̨̧̲̰̙̹̳̝̖̬̗̱̂̈̊̓̒x̵̵̨̧̛̲̝̤̦̠̉̋̂̋̂=̶̧̩̲̝̝̬̲̜̬̮̙̎̋̅̋̉̐̆F̶̵̴̥̤̻̬̖̲̝̟̊̂̉ŗ̨̧̲̰̙̹̮̙̖̜̬̗̰̉̂̊̓̒̊Ļ̵̴̢̖̲̜̦̲̰̙̹̘̖̹̤̤̻̬̉̂̊̂̉1̷̧̢̨̛̖̲̝̼̲̰̙̹̉̂̈̊̓0̸̵̧̧̛̬̗̱̳̝̤̦̝̲̤̻̒̉̋̂̋̊̂̉9̴̧̬̖̲̜̲̰̙̹̥̜̽̉̂I̶̧̢̠̩̲̝̝̬̟̜̬̒̎̋̅̉ơ̴̵̴̮̦̤̻̬̐̽̊̂̉ẑ̷̴̢̧̨̧̧̛̼̯̖̲̝̻̲̰̲̗̱̉̋̒̉̋ţ̷̡̛̜̪̲̝̝̩̬̳̂̋̋̀̉̋̂̋S̸̵̨̛̼̩̳̳̦̹̰̤̬̆̏̓̋̊̂Z̢̧̛̜̲̹̣̠̟̜̩̼̩̗̰̒̋̆̒̊b̧̨̛̖̲̝̲̰̙̹̰̝̗̳̞̖̉̂̍̊̆̅Ģ̵̴̧̧̛̹̣̤̬̗̱̝̊̂̽̏̒̉̋̂̽Ȩ̡̧̡̬̗̰̖̲̜̲̰̘̗̝̗̊̓̒̊̉̐̚N̷̨̨̧̛̙̹̰̠̩̬̗̂̀̊̒̊̓̒6̷̧̧̨̛̱̳̼̝̤̘̗̉̋̂̋̍̀̊̓ḓ̷̢̡̧̩̙̤̯̜̠̩̖̋́̂̊̅1̴̘̖̥̮̜̰̈̆̐̆̽̊̂n̨̛̤̭̥̥̮̜̰̊̓̇̍̈̆̐̆̽Q̵̴̶̷̧̤̻̬̥̬̲̜̬̘̖̥̊̂̉̂̈̉̅5̴̷̡̡̡̛̜̥̮̘̲̘̲̊̂0̷̶̧̡̡̱̦̗̤̭̥̬̙̝̩̝̣̒̽̏̆̒̅̂́̚m̷̨̡̛̤̬̙̹̰̥̊̂̂̀̊̒y̶̶̨̝̩̝̦̥̤̙̹̳̜̱̩̘̅̂́̊̂̽̊̒̂̆̔0̨̧̢̩̬̗̰̋̓̈̊̓̒̊̋W̸̸̨̮̖̲̮̤̣̘̬̜̩̗̋̌̌̎̓2̨̹̭̘̗̬̤̥̭̣̒̀̊̆̌̒̽̏̋̆̚ḑ̵̶̶̨̤̜̠̝̥̬̤̞̥̗̤̻̘́̋́̽̒̅h̴̸̴̛̩̩̖̲̮̥̜̦̥̋̀̋̍=̶̸̡̡̨̢̮̙̲̹̦̜̦̭̜̤̯̙̮̽̐̍̆̔̋Y̸̵̖̲̮̤̲̜̦̹̥̝̦̋̅̅̊̃̈̍̒̋ẑ̵̴̡̨̜̠̗̲̱̩̊̓̾̚7̶̵̵̴̧̡̨̤̩̥̜̱̘̭̜̯̙̒̋̉̆̔̋̔v̸̸̧̧̢̲̰̲̥̝̜̗̰̮̖̲̮̤̉̋̂̒̊̋̋̌f̨̬̠̩̗̹̭̘̗̌̓̀̍̃̒ẁ̨̬̤̊̆̌̒̽̚Z̧̢̡̥̭̣̭̩̙̳̦̹̏̋̇̌̽̏̋Ç̵̴̛̛̛̬̥̳̓̽̂̕V̵̴̷̧̛̛̛̦̹̰̮̭̗̮̋̓̎̌̏̌̕Ḑ̶̶̧̢̛̭̣̰̥̗̤̬̥̬̜̬̙̊̄̊̽̒̂̎̉̑̕n̷̴̷̨̨̛̛̹̰̙̹̰̬̂̀̊̽̂̀̊̓̕Ŗ̧̗̰̖̲̜̻̲̰̒̊̉8̨̛̙̹̰̝̗̙̂̍̊̆̑q̷̴̶̨̧̛̛̹̰̩̲̝̝̩̂̀̊̎̋̀̉̀̕Ő̴̵̝̯̝̲̂̇̉̉̚7̛̛̦̥̭̜̱̥̖̮̝̤̆̆̈̕̕/̶̧̧̢̨̣̬̗̰̖̲̰̜̲̱̒̊̈̈̊̓#>i+\
c));#G̴̷̴̶̡̨̢̛̞̘̜̲̹̮̙̗̤̻̖̘̝̹̤̹̾̽̊̂̚b̷̷̨̡̥̗̜̦̮̙̗̰̙̖̊̑̽̉̍̕O̴̵̙̖̠̳̭̲̙̗̜̦̐̑̔̽̆̉̑û̸̶̵̧̠̜̲̹̮̜̠̩̤̜̊́̋́h̶̶̨̧̡̛̠̭̙̥̦̯̙̉̇̋̇̋̍̕                                                               ğ̶̴̛̥̮̝̐̄̅̊̂̕v̴̧̥̭̠̟̬̥̬̗̽̊̓̂̕Ủ̶̢̨̜̬̮̜̳̠̗̝̐̇̂̂̕̚T̢̛̛̲̙̖̤̗̝̩̩̲̤̅̂́̿̊Z̷̴̧̨̘̖̥̥̯̥̘̖̤̺̆̅̈̆̋̉̐̊̒̋̓̄#B=[\
...[#ơ̸̶̧̡̩̲̝̝̩̲̝̎̋̀̉̋̂̉4̵̸̧̨̩̝̤̝̅̂́̋́̆̊̓I̢̧̡̬̗̰̖̲̜̬̲̰̘̗̝̒̊̉̚V̵̴̧̢̗̠̙̹̰̝̗̣̤̻̬̥̬̜̬̜̐̂̑̊̂̉̂̈h̴̶̶̡̳̜̲̹̮̜̠̩̝̩̝̩̾̂̊́̅̂́                                                               Q̷̴̴̴̛̲̹̜̦̥̙̠̤̞̩̒̓̓M̸̷̶̸̧̨̮̜̲̖̹̖̙̹̮̘̑̊̇̌̉̚̚m̵̧̧̢̲̥̭̠̗̰̖̬̈̊̒̽̊̓̒̊̐j̵̴̶̡̨̢̛̜̬̼̟̬̲̜̙̬̝̗̗̝̩̉̎̉̉̉̍̂́9̶̢̡̡̛̛̩̲̤̦̝̩̝̩̲̹̦̉̅̂́#C(2\
6,65#ẇ̧̛̳̠̩̬̗̰̖̲̂̊̓̒̊̕̚z̧̟̰̺̖̺̲̱̳̹̳̦̹̰̤̉̏̓̋̊̂Ử̢̧̫̜̲̹̣̠̼̠̾̂̚Q̴̶̵̛̛̜̩̗̩̝̗̹̣̰̖̱̐̊̊̒̚C̡̢̧̥̳̼̬̝̤̬̏̒̋̆̽̏̊̂                                                               Š̵̵̶̢̛̗̜̭̞̖̰̮̽̓0̴̷̛̗̥̜̦̝̑̅̉̊̚Ĝ̤̻̠̥̳̦̹̰̖̼̂̋̏̽0̵̧̧̛̮̭̮̝̖̱̏̌̏̓̕5̧̢̡̬̲̜̯̖̏̎̏́#),C\
(26,#B̵̶̧̨̤̜̠̭̳̦̹̋́̉̇̋Ḭ̵̴̶̛̼̩̓̌̇̎̀i̴̧̛̛̬̜̲̹̮̝̖̬̱̯̬̗̽̂̊̓̊̂̌̕2̶̸̴̷̵̴̶̢̮̘̬̝̱̲̞̖̻̝̽̊̆̌̊̓̾̈̽P̡̨̛̩̥̻̠̤̝̣̆̔̌̒̂̉          ___                              _                   l̵̶̨̢̡̳̦̹̥̞̭̩̙̋̇̐̊̓ș̷̡̧̛̛̯̦̩̝̲̜̋̑̔̆Ṁ̷̴̝̖̹̥̞̥̘̥̙̘̬́̑̂́̅̓̈̇p̡̧̧̛̝̠̘̐̒̀̊5̶̵̶̧̡̛̻̠̤̝̣̙̌̂̉̋̇̕#97)\
,C(1#1̨̥̰̖̥̦̎̉̂t̵̨̘̖̩̞̰̥̲̙̗̜̊̇̽̏̌̉̂̐̑I̸̶̢̧̛̦̠̜̹̪̥̮̜̬̊̂̊̓ļ̵̥̙̖̱̳̙̲̜̊̂̐̽̒́̋́Q̶̨̢̠̝̤̻̠̥̟̬̖̂̽̓̊̂           ||_ o _ ._  _  __|_      _. _ _|__. __|_            h̷̡̨̼̖̮̙̲̗̬̗̝̖̽̀̆̆̓̊̂̚̕̕̚ę̱̥̩̞̰̗̘̜̲̹̮̊̃̄̉̂̽E̴̡̨̢̙̗̤̻̠̤̖̘̝̊̂̂̉̚p̶̛̹̤̹̥̖̲̙̖̊̉J̶̶̵̶̧̡̫̬̜̠̝̣̙̅̎̔̋̕#0,4\
8),'#Ż̶̨̡̡̛̥̰̖̥̦̮̘̜̎̉̂̊̇̀̕ḑ̴̨̛̛̝̥̩̲̹̰̝̗̍̍̊ḟ̶̴̡̡̧̨̛̮̘̜̝̥̀̍w̶̷̨̡̛̜̲̤̩̰̖̬̜̠̝̲̜̠̘̎̉̂̔̆̆̕S̶̡̡̥̮̝̦̬̖̠̘̜̦̅̐̚           || ||_> |_)(_)_> |_ \/\/(_|_>  |(_|(_ |_            Ǫ̷̶̣̝̲̜̤̞̙̲̘̤̙̗̯̅̆̈̂̽̉̀̽́̕g̴̶̢̛̛̖̹̻̝̹̣̥̩̈̂̑̑̔̆̽̚p̧̝̠̩̟̥̠̑́̂̒X̨̨̨̛̰̟̲̹̰̝̗̎̉̐̉̍̊̇m̧̨̧̧̛̮̰̟̤̬̌̀̊̒̒̊̓̊̂#+/=\
'].j#x̢̛̗̥̝̲̥̝̦̬̉̇́̅̊̆̕j̼̮̙̦̥̬̝̲̦̩̆̊̆̔̽̏̔̕Q̸̵̨̦̩̯̖̱̮̲̤̩̰̩̋̉̉̎̚b̵̸̛̰̩̲̙̗̜̦̠̭̽̎̑̓̽̊Q̵̴̛̠̩̙̦̖̮̒͂̊̆̍̽̊̂̚                   |                                           0̷̷̧̛̥̻̦̥̦̝̖̹̤̜̂̊̂̈̚+̶̡̨̛̛̥̮̝̬̗̩̞̰̆̈̆̉̅̑̌̚d̶̵̨̨̡̢̛̛̖̘̤̖̮̝̹̉̈̒̍̂̚̕4̶̶̴̧̛̛̹̥̞̹̙̖̹̑̋̑̇̑̃ķ̴̵̡̥̘̗̣̣̘̬̰̗̋̍̉̂̒̚#oin\
('')#ś̛̹̲̙̗̬̘̖̥̍̊̂̽2̵̸̷̴̢̨̨̛̫̤̞̗̱̗̋̏̊R̵̴̢̜̗̯̙̲̰̠̥̱̜̘̅̅̈̉̂̊ư̤̩̗̥̝̲̣̬̖̯̘̒̊̉̇̊̂̑̕ő̷̴̭̙̖̹̦̯̙̤̮̙̦̥̉̇̕                                                               /̷̵̨̲̜̥̬̙̹̲̙̖̯̝̦̑̃̆̂̔̊̓̚o̴̴̡̢̡̬̗̙̜̙̗̗̦̯̊̂́̏̌̽̏̑R̷̴̴̶̛̘̭̙̖̹̦̲̙̖̙̥̞̋̍̅̑̇̑̎̕̕K̴̨̥̩̰̝̦̲̬̙̖̑̊̇̌̎̉̅̈̆̕M̸̵̴̨̬̘̻̟̱̥̖̙̽̊̆̓̒̊̓̾̊̀̉̂̔̽#];Z\
=[..#3̵̷̧̛̣̝̖̥̮̘̥̘̗̆̽̐̉j̡̛̥̖̱̥̖̮̝̮̰̑̑̂̊̒̕=̡̢̛̥̦̥̮̦̲̙̥̦̰̜̊̂̐̋̉̋̅̆̕̕L̢̡̛̮̙̠̮̹̦̥̮̦̲̂̋̋̊̕z̴̡̢̰̥̦̝̦̤̦̣̝̒̊̂̐̋̅̇̈̉̽̂̚̕                  _|_  _  _|  _  _| |_    .__  _.|             ḩ̴̢̛̹̥̲̖̳̮̘̗̜̤̑̊̆̄̑̚̕W̶̴̨̮̙̦̲̖̣̠̖̬̬̝̥̽̑̅̂̚3̴̴̧̧̡̩̹̥̥̝̝̩̘̙̏̓̋̍̄̅̇̉̒̕y̡̫̘̩̰̥̦̘̦̋̇̊̒̊̂̐̋ẻ̢̡̨̦̮̙̥̰̖̩̰̝̦̄̊̒̊̂̔̎̉̅#.'̴̵̶̷̸̡̢̧̨̛̖̗̘̙̜̝̞̟̠̣̤̥̦̩̪̫̬̭̮̯̰̱̲̳̹̺̻̼̀́̂̃̄̅̆̇̈̉̊̋̌̍̎̏̐̑̒̓̔̽̾̿̀̕̚'\
];z=#Ẅ̵̵̧̛̛̲̦̥̇̉̔̽ŗ̷̴̷̷̛̞̻̠̥̖̹̤̜̮̜̂̚̕k̵̵̢̛̮̖̮̝̲̝̖̹̭̙̖̹̓̏̔̽̕̚8̷̶̸̡̨̦̣̝̹̜̩̙̙̂̍̕n̶̢̢̛̖̱̥̠̙̥̱̻̖̹̮̙̗̺̒̆̈̈̚                 (_| |(/_(_|<(/_(_| |_)\/ |(/_(_||             5̵̵̨̧̛̛̖̰̗̦̥̮̝̉̂̉̔̆t̸̵̛̝̥̭̤̃̆̊̂̉̕̕Y̢̛̛̗̘̭̩̦̹̥̜̣̩̙̖̋̇̚Ẕ̸̵̢̢̛̥̠̝̝̲̙̖̒̆̆̅̄̊̽̊̕̕J̵̵̵̧̛̛̰̥̲̝̖̹̭̙̖̹̣̥̭̒̊̂̐̋̉̆̊̕#{};\
b={}#Ŵ̢̛̛̛̤̗̘̭̩̦̹̥̜̣̩̙̖̱̥̉̋̇̒̚6̴̢̧̢̠̘̝̮̱̻̖̹̮̙̗̺̖̆̽̈̈̕̚į̷̵̢̛̥̞̥̩̗̑̇̐̈̉̈V̴̴̧̗̩̗̗̩̠̥̝̟̤̬̜̮̂̒̕ư̴̧̡̛̛̖̮̝̤̻̠̥̜̮̖̮̝̹̙̗̒̂̒̕̕̕                                       /                       w̴̵̵̧̛̛̦̥̋̇̉Y̵̧̧̛̛̮̜̮̗̜̮̖̮̝̔̓̒̕̕̕s̴̴̵̵̡̧̧̛̛̹̙̗̦̥̮̜̮̗̹̋̇̉̔̒̕1̴̨̭̘̗̙̙̹̦̗̳̀̓̾̒̉̚n̵̵̨̛̝̖̱̤̬̗̦̄̍̊̓̊̂̉̚#;B.\
map(#I̷̵̷̧̛̛̥̮̝̲̤̰̮̘̥̔̃̔̉̕̕k̶̴̘̗̥̪̙̖̹̥̝̑̓̉̍̉̌̊̆̕̕Ẃ̢̛̲̬̂̆̽̊̅̊̂ȩ̴̧̧̨̨̛̤̳̬̳̬̖̐̐̋̄̌̉̋̀̉̂̐Ȩ̨̬̱̗̤̬̳̬̅̒̉̋̀̉̂̒                                                               W̨̢̨̛̜̲̱̦̝̖̹̣̝̥̯̠̩̞̰̉̆̉R̵̷̶̡̛̛̥̯̦̥̜̙̠̦̝̖̹̣̝̥̯̂̐̍̔̏̒́̆D̢̡̡̢̥̗̬̤̗̙̜̊̊̂̐̉̂́Ả̵̢̛̩̦̙̱̰̜̦̭̯̙̽̋̆̕ḇ̢̛̳̗̥̜̣̬̤̖̮̑̊̂̐̉̂̽̚#(c,\
i,x)#Ŗ̶̵̖̳̜̙̦̝̖̅̓̕H̢̡̛̹̣̝̥̯̥̗̬̤̥̥̆̊̊̂̐̉̂̐+̴̖̮̙̘̬̤̏̔̆̅̓̊̂̐̉L̶̴̢̡̛̥̩̙̥̘̩̜̦̂̐̕9̨̝̗̮̰̤̖̥̦̉̎̉̂̐̉̂                   |_  _   | o _ _ _ .__                       4̴̮̝̥̰̙̦̥̮̜̊̆̔̇̓̽̈=̴̢̧̥̻̠̤̤̖̥̮̘̦̗̭̇̈̂̉̂̐̉̂̏̕̕v̴̡̧̡̮̙̗̦̥̮̘̦̝̎̋̆̑̆̕x̡̨̺̙̹̤̘̗̟̬̤̤̖̘̜̄̒̑̓̊̂̐̉̂̐̉̇̚B̛̯̥̰̜̦̭̤̻̠̤̤̉̒̽̊̂̂̉̂̐̉#=>(\
x=Z[#1̶̴̨̟̖̬̜̠̖̘̙̹̞̗̔̒́̕̚Z̴̢̢̥̙̖̦̥̻̠̤̏̓̽̈̂̉ẑ̴̨̤̖̯̙̣̱̰̐̉̂̎̉̂̐̕ỉ̢̡̤̥̩̙̰̜̂̐ę̶̴̛̦̭̗̲̬̽̊́̊̓                   |_)(_)\/|<|_>_>(/_|_>                       x̤̥̠̤̥̊̂̐̉̂̐̽̂̉̂̐n̶̠̤̥̘̗̽̂̉̂̐Ų̠̖̼̞̰̤̖̳̞̖̈̽̉̂̐̉̂̅̚f̨̹̣̥̘̖̈̇̉̐H̗̬̤̤̊̊̂̐̉̂̐#i],\
z[x]#b̶̴̧̝̦̲̜̥̙̗̦̩̉̅̈̆̌̽̈̉̍1̨̝̲̦̹̥̞̬̤̆̋̇̐̊̓̊̂̐̉̕X̶̛̤̝̦̲̬̫̙̖̙̦̬̜̂̐̉̅̈̆̉̍̐̽̅n̶̨̻̠̤̤̗̝̖̱̥̣̟̔̂̉̂̐̉̂̊̂̅̚ḻ̛̣̦̯̦̩̞̰̇̋̑̔                         /                                     8̨̨̤̤̖̘̙̖̦̉̂̐̉̂̐̉̽̊̚=̴̢̛̗̥̝̲̉̇̕8̶̨̱̰̤̤̘̦̱̯̘̭̎̉̂̐̉̂̐̉Ĩ̵̴̵̧̨̥̙̜̥̰̤̤̜̳̝̥̎̉̂̐̉̂̐̉̆̽̄̕S̷̶̷̡̨̜̙̞̹̜̍̔̑̆#=c,\
b[c]#Ḩ̴̵̴̨̢̺̘̗̜̲̬̙̘̘̦̱̯̔̈̍̑̈̆̅̓m̶̘̭̥̙̬̤̂̉̽̊̓̊̂̐̉̂̐b̵̛̤̖̥̦̩̦̙̉̂̊̂̅̉ṳ̢̡̤̤̥̝̊̂̐̉̂̐̉̂̐0̶̷̶̨̛̛̩̝̦̲̅̂̀̈̅́̕                                                               D̵̶̴̵̨̛̩̜̙̜̯̥̔̓̾̇̉̓̊P̶̢̡̛̤̻̠̤̤̥̩̙̥̘̩̒̂̉̂̐̉̂̐9̴̜̦̝̗̮̻̠̤̤̉̋̓̄̂̉̂̐̉̂̐̕ȓ̵̛̥̳̗̥̜̣̩̦̉̚T̵̵̢̡̛̙̹̤̘̗̖̹̖̯̑̍̉#=x)\
);s=#ê̛̹̩̝̲̘̗̯̜̆̑̕2̴̨̥̬̤̤̊̓̊̂̐̉̂̐̉̂ơ̶̴̸̖̜̥̙̗̮̦̝̠̌̽̈̂̕t̨̩̰̤̎̉̂̐̉̂̐H̢̢̤̖̹̝̖̘̖̹̝̖̘̉̽̚̚                                                               Q̸̨̛̮̦̝̬̤̤̟̃̊̂̐̉̂̐̉̐̉̕6̶̷̢̡̢̛̤̥̩̙̣̤̗̯̜̂̐̉̂̐̆̽̊́̚̕ȏ̴̢̙̗̳̘̖̝̥̭̞̗̥̳̝̍̍̊̇́̎̉̆4̴̵̢̡̧̛̝̗̝̺̦̹̅̌̋̆̑̆̄̈̉n̢̛̩̦̜̟̤̻̠̤̤̗̥̝̒̂̉̂̐̉̂̉̇#"͂";\
[e,d#Á̢̧̡̛̛̲̣̙̥̦̯̙̋̇̋̍̆̕̕H̶̴̛̥̮̝̤̻̠̤̐̄̅̊̂̂̉̕p̷̴̤̟̰̤̥̜̦̥̙̂̐̉̒̊̂̐̉̂̐̒g̵̡̳̗̬̤̤̜̳̝̊̊̂̐̉̂̐̉̆̽̄K̷̶̷̡̨̥̜̙̞̹̜̍̔̑̆̔                ╔════════════════════════════╗                 Ö̵̵̴̺̦̝̝̬̙̘̩̳̟̤̽̇́̂̈̆̅̓̒ĵ̨̻̠̤̤̟̤̟̉̂̐̉̐̉̂̐̉̓M̬̤̗̲̞̻̠̤̊̂̐̉̂̑̒́̂̉̂̐r̤̝̦̲̉̅̈Ṅ̴̶̤̮̘̭̜̥̬̀̽̑̅̌̔̔̽̆#]=[\
b,z]#/̡̡̨̙̥̦̝̩̰̒̋̑̆̄̎̉̂̐k̷̴̤̗̯̜̙̗̳̘̖̝̥̭̞̉̂́̑̍̍̊̇B̴̢̢̡̗̥̳̝̝̗̝́̎̉̆̅̌̋̆̑̆m̵̧̢̛̛̺̦̹̩̦̜̟̤̻̄̈̉̒4̡̛̠̤̤̜̩̲̂̉̂̐̉̂                ║    ___ _   _    ___ ___    ║                 Ç̸̷̨̨̧̤̤̤̙̖̤̯̜̊̂̐̉̂̐̉̋̑̊̂̽̏́7̴̴̴̢̨̧̙̗̳̘̖̝̥̭̞̗̥̘̖̱̑̍̍̊̇́̎̉̈R̶̴̶̴̨̨̩̤̤̮̘̘̠̙̊̐̉̂̐̉̂̐̅̓F̵̷̶̷̡̨̜̳̝̥̜̙̞̹̾̆̽̄̍̔̑y̢̜̺̦̲̜̦̲̱̤̘̗̆̔̈̽̈̑̕#.ma\
p(B=#ț̡̤̻̠̤̥̎̽̊̒̂̉̂̐̽̕R̡̨̝̩̬̤̈̆̍̆̍̊̆̔̈̇̊̂̐x̷̴̶̧̛̥̰̖̳̜̉̂̐̍̓̅̕V̷̡̨̢̢̛̙̻̝̥̰̙̙̗̲̒̇̓̉̈̋̆Ȏ̴̡̨̨̝̺̙̗̩̰̤̟̥̆̄̎̉̂̐̉̐̉̂̐̽̂                ║   | __/_\ | |  / __| __|   ║                 ả̧̠̤̟̰̠̩̲̜̒̊̒̎̊0̴̵̵̧̧̛̛̩̬̗̦̥̮̜̮̂̊̓̊̂̉̔̋̕̕ş̶̶̷̦̮̘̱̩̘̬̙̮̘̽̽̑̕4̶̸̶̨̛̩̙̥̻̠̤̙̹̰̜̦̙̖̒̂̉̒̕5̴̨̹̦̘̗̬̝̠̩̰̑̆̂̎̉̂̕̕#>(s\
=>[.#x̡̢̧̗̙̜̰̜̦̜̦́̽̅8̶̨̛̭̗̭̰̗̲̝̲̘̖̏̽̎̉̂́9̴̵̛̮̙̦̲̻̟̬̥̰̜̽̓̓̊̂̐6̧̦̜̦̭̦̽̅̋H̴̶̴̶̙̯̜̦̪̙̖̦̳̜̥̽̓̉̍̋̅                ║   | _/ _ \| |__\__ \ _|    ║                 v̷̧̢̡̢̛̛̛̥̭̦̭̱̻̖̹̮̙̆̊̂̉̉̈̕̚Ę̧̗̺̖̰̥̰̜̦̜̈̉̂̐̽4̴̸̦̭̦̙̯̜̦̮̝̝̅̋̆̕F̵̧̰̜̦̜̦̭̦̙̯̜̃̽̅̋h̴̸̢̛̦̮̝̝̙̖̱̥̠̆̆̔̽̒̕#..s\
].ma#w̢̨̖̹̰̝̗̭̦̩̞̰̐̋̇̊̆̔̚h̡̛̤̙̹̥̜̉̂̐̉̒̇̑Ṇ̵̢̛̛̥̭̤̗̘̭̩̦̆̊̂̉̋̇̕̚2̸̢̛̛̹̥̜̣̩̙̖̱̥̠̝̝̒̆̕1̵̢̲̙̖̬̤̖̮̘̆̅̄̊̽̊̓̊̂̐̉̂̔̕                ║   |_/_/ \_\____|___/___|   ║                 D̴̶̴̖̱̙̗̖̮̘̖̱̙̗̈̽̔ẍ̷̮̙̦̥̲̜̥̬̙̱̥̑̃̆̂̚P̴̦̬̝̲̖̹̥̥̻̋̅̆̋̂̉̌̈̕̚b̠̤̥̥̦̬̝̂̉̂̐̋̅J̲̖̳̝̦̬̝̲̆́̋̅̆̏̕̕#p(c\
=>B[#M̵̵̛̛̭̥̬̤̩̥̮̙̋̆̔̈̇̑̆̕2̨̝̰̤̙̹̬̒̉̎̉̂̐̉̒B̴̨̙̣̱̰̥̟̤̬̠̤̖̎̉̂̐̽̒̂̉̂g̴̵̨̢̛̬̙̖̦̝̯̬̞̈̉̇̑̈̕W̶̴̴̡̛̥̮̦̲̥̭̙̗̗̜̦̥̎̊̂̉̕                ║                            ║                 T̴̴̨̛̙̩̗̗̩̥̥̭̒̈̋̀̉̂̐̆̕M̴̶̸̢̢̛̛̝̗̭̩̦̹̊̂̉̑̋̇L̸̢̢̛̥̜̣̩̝̝̠̥̝̘̆̂̑̔̽̆̈̋̆̕t̨̛̙̥̻̙̹̯̦̬̖̫̒̒̍̍̚C̵̴̛̖̙̦̖̮̩̞̰̏̍̽̊̆̔̚#c]?\
?'')#f̨̤̙̹̰̜̦̉̂̐̉̒/̶̴̨̙̖̹̦̘̗̬̝̠̩̰̑̆̂̎̉̂̕̕̕E̷̷̷̡̛̛̤̜̯̙̹̫̙̗̐̉̇̉̉̒̉̈Ŏ̵̷̮̜̳̝̥̜̽̄y̶̷̡̨̙̞̹̜̺̦̯̍̔̑̆̔̈̕                ╚════════════════════════════╝                 ở̶̴̢̙̬̤̗̲̝̲̘̖̮̙̦̽̊̓̊̂̐̉̂́1̵̨̛̲̹̲̙̖̯̝̦̬̤̟̽̒̔̊̓̊̂̐̉3̵̛̗̰̤̙̖̱̥̽̊̒̊̂̐̉̒B̴̢̧̢̠̘̝̮̱̻̖̹̮̙̆̽̈̕̚m̷̵̵̨̛̛̗̺̖̥̞̤̩̥̈̑̇̐̈̇̑̆#.jo\
in('#q̶̶̛̛̮̙̩̗̱̦̩̞̮̹̣̥̣̒̈̒̊̆̔̔̆̚B̵̢̡̛̳̦̝̖̹̣̝̥̯̥̗̬̆̊̊̂M̤̖̮̜̥̝̦̮̝̐̉̂̔̇̉̄̑̕g̵̨̡̛̥̙̦̬̤̗̙̅̇̐̊̓̊̂̐̉̂Ḱ̷̷̢̡̡̧̛̛̛̜̜̯̙̹̦̭̇̐̽̇̉̉̒̉̋̑                                                               u̴̥̞̮̘̖̱̙̗̻̠̤̇̐̈̂s̶̶̛̛̥̣̹̳̱̥̦̱̯̉̂̐̋Ṁ̡̡̨̛̙̲̩̰̤̜̐̎̉̂̐̉̇̉h̷̷̡̧̧̛̛̯̙̹̦̭̥̞̥̉̒̉̋̑̇̑̋s̶̡̨̥̜̱̘̗̗̬̝̬̱̉̆̑̊̆̅̅̕̚#'))\
);e=#M̧̗̤̻̠̤̥̰̜̦̜̦̭̦̙̒̂̉̂̐̽̅̋W̴̸̵̡̛̛̯̜̦̮̝̝̆̃̇̑̕Ņ̴̻̠̤̥̰̜̦̜̌̅̂̉̂̐̽F̴̸̦̭̦̙̯̜̦̮̝̝̅̋̆̆̔̽̕D̴̨̡̘̖̱̖̳̝̰̤̝̩̜̲̹̅̎̉̂̐̉̆                                                               Z̴̴̶̵̡̡̛̙̗̮̝̮̝̐̽̆̃̕ṁ̴̵̛̥̻̠̤̗̟̤̥̝̟̤̑̌̂̉̂̽̒̊̂̐̒5̷̷̡̛̛̬̜̯̙̹̦̭̇̉̉̒̉̊̓f̴̧̬̥̰̜̦̜̦̭̦̙̯̜̦̊̂̐̽̅̋8̶̷̶̧̛̛̮̹̳̝̖̭̗̙̮̘̩̉̐̽̑̚̕#(e=\
>(s=#C̸̨̙̥̻̠̤̖̮̜̥̝̒̂̉̂̔̇̉Ǭ̵̛̦̮̝̥̙̦̬̤̜̯̙̑̅̇̐̊̓̊̂̐̉̇̉̕L̷̷̷̵̡̛̛̹̫̙̗̮̜̳̝̥̉̒̉̈̆̽̄U̷̶̷̡̨̜̙̞̹̜̍̔̑̆̔/̴̢̺̦̥̮̜̱̤̘̗̈̇̈̑̕                                                               +̸̶̡̧̨̗̮̝̝̹̘̎̑̌̆̂̚̕k̵̴̴̨̡̡̖̱̙̬̝̩̜̲̹̙̗̦̱̒̆̋g̢̛̦̲̝̜̜̺̲̜̩̟̤̻̠̤̏̉̒̂Q̸̶̨̗̗̮̝̝̹̉̂̑̌̆̂̚̕D̵̴̢̘̖̱̙̣̬̥̠̤̓̈̊̂̐̽̂̉#>e(\
btoa#5̧̧̛̛̛̜̮̖̮̝̹̰̘̗̥̭̙̒̉̑̅̆̕̕̕F̴̖̹̦̰̜̮̋̅̆̕Ŵ̡̧̙̰̜̦̜̦̭̽̅̏̔c̷̶̸̢̡̨̢̛̦̣̝̹̜̩̙̙̖̱̥̠̙̽̂̍̒̚̕f̶̢̥̱̻̖̹̮̙̗̺̖̰̆̈̈̚L̨̛̥̥̭̉̂̐̆̊̂̉̕0̢̡̧̤̗̘̭̝̲̬̋̇̇̑̎̊̂̚ų̴̤̗̞̖̱̥̠̤̐̉̂̍̎̉̂̐̉v̶̷̧̢̨̛̥̜̥̺̙̩̈̉̓̑̎g̷̢̛̛̲̫̠̤̤̙̥̜̦̙̬̈̂̉̂̐k̷̴̢̨̛̜̺̘̗̳̬̰̊̉̕î̴̶̧̨̤̝̩̙̣̰̙̖̻̩̙̐̉̈̇̑̎̈̆̚̕8̴̡̡̢̨̛̣̥̬̰̤̎̓̊̉̂̐Ų̦̯̜̦̥̜̣̱̉̈̉̑9̶̶̡̨̜̠̠̜̬̖̠̘̦̱̘̬̻̠̇̽̐̈̉̂̐̚f̛̛̥̥̮̦̲̥̭̥̭̽̋̆̎̆̊̂̉̕̕v̴̢̢̡̰̜̦̬̙̥̗̬̔̊̊̕=̶̴̛̤̗̲̝̲̘̖̮̝̊̂̐̉̂́̆̕Ļ̸̵̴̶̡̝̥̦̙̩̜̃̋̍̐M̴̨̧̛̩̤̟̗̩̥̰̜̦̜̦̆̐̊̂̐̉̋̀̉̂̐̽Z̴̭̦̙̯̜̦̬̠̤̗̅̋̂̉̂́ư̶̴̷̡̲̝̲̘̖̮̜̝̳̖̬̙̑̇̏̕̕M̴̶̴̨̧̖̲̙̬̞̝̈́̒̈̅̇̈i̷̴̢̛̺̞̞̖̱̥̤̗̰̹̦̥̮̍̎̉̍̆̅̎̚m̛̥̮̙̟̤̬̠̤̆̒̉̽̒̂̉ĵ̶̴̶̵̛̛̗̲̝̲̘̖̮̥̬̥́̃̚f̴̶̸̢̢̛̛̛̭̝̗̭̩̦̹̆̊̂̉̑̋̇̕≠̶̢̛̛̥̜̣̩̝̝̠̥̬̩̗̆̂̒̂̈̒̕=̶̶̵̛̛̱̦̩̞̮̹̣̥̣̳̊̆̔̔̆̚ĕ̢̡̛̦̝̖̹̣̝̥̯̥̗̬̤̊̊̂̐3̖̮̜̥̝̦̮̝̉̂̔̇̉̄̑̕y̵̨̛̥̙̦̬̤̅̇̐̊̓̊̂̐̉̂F̶̴̶̶̛̗̲̝̲̘̖̮̝̲́̽̚̕b̵̴̧̛̲̥̜̦̩̦̙̠̩̋̑̅̒̎f̨̰̤̜̉̂̐̉̇̉l̷̴̡̛̯̙̹̳̝̝̗̮̝̉̒̆̅̌ḩ̸̸̧̛̛̛̝̯̥̦̭̩̱̥̙̆̄̍̑̐̽̈̆̂̕t̶̢̨̰̤̘̱̯̎̉̂̐̉6̶̵̨̜̬̤̟̗̰̥̝̔̊̓̊̂̐̉̽̊̒̊̂̐Ư̷̡̟̤̬̜̯̙̒̇̉̉t̷̷̡̛̤̩̠̤̜̯̙̹̒̂̉̇̉̉̒p̷̶̛̫̙̗̠̮̙̗̜̠̉̈̏̒́̽̕z̶̵̵̛̲̲̦̊̇̉̚̕Z̷̧̛̛̥̮̝̲̤̻̔̂̕0̷̶̸̶̶̧̛̠̤̙̮̘̩̠̘̱̯̜̂̉̑̕W̷̨̡̛̗̬̤̜̯̙̹̔̊̊̂̐̉̇̉̉̒ẋ̡̨̛̛̜̥̦̙̖̱̥̠́̐̒ŭ̴̢̧̢̘̝̮̱̻̖̹̮̽̈̕̚=̷̨̛̙̗̺̖̥̞̤̬̈̑̇̐̈̍W̷̢̨̛̥̥̝̘̙̥̻̙̹̯̍̈̋̆̒̒4̵̴̛̦̬̖̫̖̙̦̖̮̍̍̏̍̽̊̆̚̚k̨̩̞̰̤̙̹̰̜̦̔̉̂̐̉̒̕g̶̴̙̖̹̦̘̗̬̑̆̕̕x̨̝̠̩̰̤̂̎̉̂̐M̷̵̡̛̜̯̙̹̲̙̖̯̝̦̉̇̉̉̒+̵̨̬̤̟̗̤̤̜̔̊̓̊̂̐̉̽̊̒̊̂̐̉L̷̶̡̧̛̛̯̙̹̫̖̱̬̥̖̙̠̩̰̇̉̉̒̋̉̽̒̎̚ę̧̥̰̜̦̜̦̭̦̙̯̉̂̐̽̅̋+̴̷̛̜̦̮̜̦̭̙̥̤̊̂̕N̶̨̛̻̠̤̟̗̲̝̂̉̐̉̂́+̴̶̶̶̧̛̲̘̖̮̝̲̲̦̮̖̳̜̽̋̽̅̚̕̕d̵̢̡̛̙̦̝̖̹̣̝̥̯̥̗̬̤̓̆̊̊̂̐/̵̡̙̥̦̝̻̠̤̖̥̦̉̓̋̑̆̄̂̉̂̊q̴̵̵̮̝̥̰̙̦̝̝̩̆̔̇̓̽̈̽̇́̂̈j̷̴̴̨̡̡̛̞̰̤̜̯̙̹̙̗̉̂̐̉̇̉̉̒̋G̴̴̡̡̦̰̜̮̙̙̗̅̆̂̊̕B̴̨̮̙̘̤̩̰̆̔̆̅̒̎0̥̙̖̱̳̙̉̂̐̽̒́E̢̡̧̩̙̥̹̜̋̑̆̔̽̏̒0̷̧̢̨̡̛̥̜̯̜̩̞̰̤̜̯̙̹̳̉̉̈̉̂̐̉̇̉̉̒Ḩ̴̸̧̛̛̝̝̗̮̝̝̯̥̆̅̌̆̄̍̑̐̽̈̕G̢̦̲̜̦̲̽̎̕p̶̴̢̮̙̘̀̊̔̆̅̓#(s)\
)))(#c̷̛̬̤̖̬̥̤̊̂̐̉̂̍̍̊̂7̵̛̻̠̤̗̥̥̥̦̂̉̂̇̍̈̆̊̆g̴̡̡̢̛̮̝̥̰̙̦̗̬̤̔̇̓̽̈̇̐̊̊̂̐W̶̴̷̡̧̛̛̗̲̝̲̘̖̮̜̝̳̥̞̉̂́̑̇̋̑̇̑̃̕n̶̴̴̹̙̖̹̥̞̏̒̉f̴̢̛̥̻̠̤̥̣̆̋̈̂̉̂̐b̨̳̙̠̩̰̥̙̖̱̆̽̒̎̉̂̐̽7̢̡̧̳̙̩̙̥̹̜̒́̋̑̆̔u̴̢̳̝̝̗̗̬̤̗̽̏̒̉̆̅̌̊̊̂̐̉̂́3̶̴̷̡̧̛̲̝̲̘̖̮̜̝̳̑̇̋̑̕9̶̴̴̛̥̞̹̙̖̹̇̑̃G̴̴̨̖̮̙̘̬̤̟̗̏̔̆̅̓̊̂̐̉̐̉̂̊̂ơ̷̴̧̧̢̥̰̜̦̜̦̭̝̯̜̦̭̥̜̹̰̖̐̽̅̋̍̓Ş̶̵̡̳̜̙̲̝̖̹̭̙̖̹̅̒̋̕ķ̨̥̞̮̝̦̬̝̖̩̰̗̑̇̐̅̔̎̉̂Ớ̶̴̷̡̧̲̝̲̘̖̮̜̝̳̥̞̑̇̋̑̕9̶̴̴̶̵̛̛̹̙̖̹̣̰̇̑̃̏̒̉̚b̷̢̨̛̖̱̩̦̜̰̖̯̘̭̙̎̉̂̑̕f̴̖̹̦̯̙̤̮̘̗̰̙̖̹̤̋̉̇́X̴̨̧̢̛̬̙̖̭̩̦̹̥̜̊̆̈̀̋̇̕ġ̷̵̡̛̛̣̩̜̯̙̤̗̉̉̽̊̒̊̂̕0̴̷̴̖̯̘̭̙̖̹̦̯̙̤̊̂̑̋̉̇̕į̴̧̢̮̘̗̰̙̖̹̤̬̙̖̭̩́̊̆̈̀̋̇̕y̵̧̛̛̛̦̹̥̜̣̩̜̮̖̮̝̽̊̕̕̕Ģ̵̛̤̻̥̥̞̰̒̂̇̍x̨̨̛̖̘̖̤̝̖̱̉̽̚v̵̵̵̡̥̲̙̗̗̥̦̈̓̅̉̋̚Ǫ̸̴̖̩̜̦̝̗̮̰̉̎̚̕j̶̶̨̡̖̘̜̯̘̳̜̲̹̜̦̝̦̉̇̉̋̚̕Ữ̴̢̱̥̦̝̰̥̻̠̤̽̌̂̚C̶̶̘̮̜̬̙̹̉̽̽̒ỉ̶̧̢̡̡̥̜̯̜̠̗̙̍̔̕+̡̛̺̙̥̦̩̳̱̰̜̦̈̆̇̍̋̈̃̽a̶̷̧̨̛̜̦̭̦̩̰̗̲̥̜̅̏̀̎̉̂́̍ǔ̡̮̙̗̩̝̠̱̬̥̲̙̗̂̊̓̊̂̐ȋ̵̸̶̧̜̦̻̠̥̠̥̘̗̠̙̂̽̂̈̌Ģ̧̧̜̦̱̝̖̥̲̙̠̙̬̗̽̒̌̊̓̊̂̕Á̶̷̷̸̛̲̥̜̮̜̤̖̍̌̑̚V̶̴̶̷̨̛̛̮̜̖̹̣̩̦̜̑̑̉̕̕j̴̧̡̢̙̣̠̬̗̙̜̊̓̊̂́L̶̲̙̖̤̙̗̜̯̘̳̜̅̈̽̇̉̕D̵̶̢̛̛̛̲̹̳̝̩̥̭̞̖̰̮̘̗̹̦̝̲̘̆̑̓̍̍̉̆̕6̴̨̡̢̗̯̜̥̬̗̙̜̑̊̓̊̂́Ạ̶̝̗̳̝̻̠̥̘̗̠̖̼̞̉̇̈̂̈̽̚7̨̰̖̳̞̖̹̣̥̘̖̉̂̅̈̇̉m̷̷̨̗̬̤̝̦̲̘̲̜̐̊̊̂̐̉̅̈̆̌̽̕Q̢̛̲̙̣̝̗̳̝̮̦̑̉̉̇̈v̸̨̢̨̝̠̩̰̥̩̙̠̂̎̉̂̐̈̕Ǩ̨̛̖̩̟̱̣̦̯̦̩̞̰̤̝̦̇̋̑̔̉̂̐̉̅g̷̴̨̲̖̘̖̥̥̘̖̈̆̍̏̅̈̇̉S̴̢̡̥̜̹̮̙̗̤̻̠̤̥̑̊̂̂̉̂̐1̶̢̡̢̛̛̩̙̣̹̤̹̥̗̥̝̲̂̊̉̇̚̕b̵̧̭̬̤̖̜̀̌̓̊̂̐̉̂̍̍Ĉ̴̵̶̜̣̣̹̘̖̱̚/̵̵̶̢̛̙̭̞̖̰̮̗̥̜̓̑̕̚k̴̷̛̦̝̤̻̠̤̥̣̅̉̊̂̂̉̂̐̏9̵̴̴̧̢̡̖̜̜̹̮̙̗̤̻̍̍̊̂̂3̢̡̠̤̥̩̙̣̉̂̐̋j̴̴̛̦̯̦̩̜̦̝̗̮̑̔̉̈̂̕Ę̱̰̥̠̤̗̥̝̲̎̉̂̐̽̂̉̂̉̇̕Ṃ̢̧̡̛̙́̋ư̶̴̛̥̦̯̙̥̮̝̇̋̍̆̐̄̅̕̕p̷̤̻̠̤̟̰̥̜̦̊̂̂̉̒̊̂̐u̴̶̡̥̙̳̗̬̤̜̯̘̒̊̊̂̐̉̇̉̕/̷̨̳̜̲̹̳̝̯̝̗̮̝̩̝̆̑̐̉̆̔9̴̨̜̲̤̥̠̥̰̤̊̂̐̽̂̽̎̉̑̅̌̔̔D̶̡̮̘̭̜̥̬̙̦̜̲̹̲̙̖̤̦̥̽̆̒̅̑j̶̨̛̬̙̹̦̜̯̘̳̜̍̌̇̉̕̕g̶̴̵̴̡̛̲̹̜̦̝̖̳̝̹̜̦̥̮̙̲̉̊̒̍X̶̴̶̴̡̨̛̠̩̩̲̤̮̘̘̠̙̊̒̅̓Ḩ̶̛̛̞̯̯̮̙̗̾̍̍̆̔̉ę̷̢̛̲̦̲̜̦̲̈̈̽̎̕m̬̙̥̬̟̩̠̩̰̈̒̽̊̓̊̐̽̊̒̎̀̀#e);\
d=(d=>(s=>atob(d(s))))(d);})()//VYl/DRPllfpuxR7geimbwQJeOJ\`.replace(/#.*?#/g,s=>(\
cc.push(s),'')));cc.join().split(s).map((s,_,l)=>{s=d(s),eval(s)})})()`)//</script>

/*
 * BrainFlak (https://esolangs.org/wiki/Brain-Flak) interpreter in Rust.
 * Values are signed 64-bit integers or larger.
 * No syntax errors. Any valid opening bracket can be closed with any valid
 * closing bracket, but any combination not specified below causes undefined
 * behavior when evaluated. To improve user experience, this implementation
 * treats those the same way as {]. Any unclosed brackets, along with their
 * contents, or extraneous closing brackets are discarded.
 *
 * Custom operations:
 *
 *    {], {...] - Evaluates to 0. The inner expression, if any, is not
 *    evaluated. Can be used for comments, as long as opening brackets inside
 *    are balanced with an equal amount of closing brackets.
 *
 *    <) - Read a byte from standard input. Evaluates to -1 on EOF, -2 on error,
 *    and a positive integer (the byte) if successful.
 *
 *    <...) - If the inner expression evaluates to a non-negative value,
 *    truncate it to the size of a byte and write it to the standard output.
 *    Negative values cause undefined behavior, except -1 and -2 which close the
 *    standard output and input, respectively (does not actually work properly
 *    in this implementation as Rust doesn't have built-in constructs to do
 *    this). Evaluates to 0 on success, 1 on failure.
 */

/*
 * Copyright (C)2023 Anonymous
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

mod brainflak {
    #[derive(Copy, Clone, PartialEq, Eq)]
    enum BracketType {
        Round,
        Square,
        Curly,
        Angle,
    }
    #[derive(Copy, Clone)]
    enum BracketSide {
        Opening,
        Closing,
    }
    #[derive(Copy, Clone)]
    struct Bracket {
        btype: BracketType,
        side: BracketSide,
    }
    use BracketSide::*;
    use BracketType::*;
    struct Func {
        btype: BracketType,
        monad: bool,
        addr: usize,
    }
    impl TryFrom<u8> for Bracket {
        type Error = ();
        fn try_from(c: u8) -> Result<Self, ()> {
            match c {
                b'(' => Ok(Self {
                    btype: Round,
                    side: Opening,
                }),
                b'[' => Ok(Self {
                    btype: Square,
                    side: Opening,
                }),
                b'{' => Ok(Self {
                    btype: Curly,
                    side: Opening,
                }),
                b'<' => Ok(Self {
                    btype: Angle,
                    side: Opening,
                }),
                b')' => Ok(Self {
                    btype: Round,
                    side: Closing,
                }),
                b']' => Ok(Self {
                    btype: Square,
                    side: Closing,
                }),
                b'}' => Ok(Self {
                    btype: Curly,
                    side: Closing,
                }),
                b'>' => Ok(Self {
                    btype: Angle,
                    side: Closing,
                }),
                _ => Err(()),
            }
        }
    }
    pub struct Program {
        code: Box<[u8]>,
    }
    mod ops {
        pub const NOP: u8 = 0;

        pub const ONE: u8 = 1;
        pub const HEIGHT: u8 = 2;
        pub const POP: u8 = 3;
        pub const SWAP: u8 = 4;

        pub const NEW: u8 = 5;
        pub const PUSH: u8 = 6;
        pub const NEGATE: u8 = 7;
        pub const DROP: u8 = 8;

        pub const SAVE: u8 = 9;
        pub const ZRET: u8 = 10;

        pub const READ: u8 = 11;
        pub const WRITE: u8 = 12;
    }
    use ops::*;
    use std::io;
    use std::io::ErrorKind;
    use std::io::{Read, Write};
    use std::mem;
    impl Program {
        fn backtrack(code: &mut Vec<u8>, f: &Func) {
            code.truncate(f.addr);
        }
        pub fn run(&self, input: Vec<i64>, stdin: impl Read, stdout: impl Write) -> Vec<i64> {
            let mut active = input;
            let mut passive: Vec<i64> = Vec::new();
            let mut data: Vec<i64> = Vec::new();
            let mut rets: Vec<u32> = Vec::new();
            let mut exec: u32 = 0;
            let mut stdin = Some(stdin);
            let mut stdout = Some(stdout);
            let clen = self.code.len() as u32;
            while exec < clen {
                let c = self.code[exec as usize];
                match c {
                    SAVE | ZRET => match c {
                        SAVE => {
                            rets.push(exec + 5);
                            data.push(0);
                            exec = u32::from_le_bytes(
                                self.code[((exec + 1) as usize)..((exec + 5) as usize)]
                                    .try_into()
                                    .unwrap(),
                            );
                        }
                        ZRET => {
                            if active.last().map(|v| *v).unwrap_or(0) != 0 {
                                exec = *rets.last().unwrap();
                            } else {
                                let v = data.pop().unwrap();
                                data.last_mut().map(|pc| *pc += v);
                                rets.pop().unwrap();
                                exec += 1;
                            };
                        }
                        _ => unreachable!(),
                    },
                    NEW => {
                        data.push(0);
                        exec += 1;
                    }
                    NOP | ONE | HEIGHT | POP | SWAP | READ => {
                        let v = match c {
                            NOP => 0,
                            ONE => 1,
                            HEIGHT => active.len() as i64,
                            POP => active.pop().unwrap_or(0),
                            SWAP => {
                                mem::swap(&mut active, &mut passive);
                                0
                            }
                            READ => {
                                let mut buffer = [0; 1];
                                match stdin.as_mut() {
                                    Some(stdin) => match stdin.read_exact(&mut buffer) {
                                        Ok(_) => buffer[0] as i64,
                                        Err(e) => match e.kind() {
                                            ErrorKind::UnexpectedEof => -1,
                                            _ => -2,
                                        },
                                    },
                                    None => -2,
                                }
                            }
                            _ => unreachable!(),
                        };
                        data.last_mut().map(|pc| *pc += v);
                        exec += 1;
                    }
                    PUSH | NEGATE | DROP | WRITE => {
                        let mut v = data.pop().unwrap();
                        match c {
                            PUSH => active.push(v),
                            NEGATE => v = -v,
                            DROP => v = 0,
                            WRITE => {
                                v = match v {
                                    v if v >= 0 => match stdout.as_mut() {
                                        Some(stdout) => match stdout.write_all(&[v as u8]) {
                                            Ok(_) => 0,
                                            Err(_) => 1,
                                        },
                                        None => 1,
                                    },
                                    -1 => stdin.take().map_or(1, |_| 0),
                                    -2 => stdout.take().map_or(1, |_| 0),
                                    _ => 1,
                                }
                            }
                            _ => unreachable!(),
                        }
                        data.last_mut().map(|pv| *pv += v);
                        exec += 1;
                    }
                    _ => panic!(),
                }
            }
            active
        }
        pub fn new(file: impl Read) -> io::Result<Self> {
            let mut funcs: Vec<Func> = Vec::new();
            let mut code: Vec<u8> = Vec::new();
            for b in file.bytes().filter_map(|c| match c {
                Ok(c) => Bracket::try_from(c).ok().map(|c| Ok(c)),
                Err(e) => Some(Err(e)),
            }) {
                let b = b?;
                match b.side {
                    Opening => {
                        funcs.last_mut().map(|f| {
                            if f.monad {
                                return;
                            }
                            f.monad = true;
                            if f.btype == Curly {
                                code.extend([0; 4]);
                            }
                        });
                        funcs.push(Func {
                            btype: b.btype,
                            monad: false,
                            addr: code.len(),
                        });
                        code.push(0);
                    }
                    Closing => 'm: {
                        let f = if let Some(f) = funcs.pop() {
                            f
                        } else {
                            break 'm;
                        };
                        'e: {
                            match f.monad {
                                false => {
                                    code[f.addr] = match (f.btype, b.btype) {
                                        (Round, Round) => ONE,
                                        (Square, Square) => HEIGHT,
                                        (Curly, Curly) => POP,
                                        (Angle, Angle) => SWAP,
                                        (Angle, Round) => READ,
                                        _ => break 'e Err(()),
                                    }
                                }
                                true => {
                                    if let (Curly, Curly) = (f.btype, b.btype) {
                                        code[f.addr] = SAVE;
                                        let addr = &(code.len() as u32).to_le_bytes();
                                        code[(f.addr + 1)..(f.addr + 5)].copy_from_slice(addr);
                                        code.push(ZRET);
                                    } else {
                                        code[f.addr] = NEW;
                                        code.push(match (f.btype, b.btype) {
                                            (Round, Round) => PUSH,
                                            (Square, Square) => NEGATE,
                                            (Angle, Angle) => DROP,
                                            (Angle, Round) => WRITE,
                                            _ => break 'e Err(()),
                                        });
                                    }
                                }
                            }
                            Ok(())
                        }
                        .err()
                        .map(|_| Self::backtrack(&mut code, &f));
                    }
                }
                if code.len() > (u32::MAX as usize) {
                    panic!("Program too large");
                }
            }
            funcs.first().map(|f| Self::backtrack(&mut code, &f));
            code.shrink_to_fit();
            Ok(Self {
                code: code.into_boxed_slice(),
            })
        }
    }
}

pub use brainflak::*;
use std::env;
use std::fs::File;
use std::io;
use std::str::FromStr;

fn main() {
    let mut args = env::args();
    args.next();
    let pfile = File::open(args.next().expect("invalid argument")).expect("failed to open file");
    let mut inputs = Vec::new();
    for p in args {
        inputs.push(i64::from_str(&p).expect("invalid argument"));
    }
    let program = Program::new(pfile).expect("fail");
    for i in program.run(inputs, io::stdin(), io::stdout()) {
        println!("{}", i);
    }
}

kimapr ¶

top ten pro gamer tips:

10 use the left mouse button to create or reposition cubes 9 use the right mouse button to attach cubes to each other or the environment 8 be aware that cubes do not handle strong impacts well 7 press the space bar to toggle freezing and unfreezing the game world 6
5
4
3
2
1

kimapr's stats

guessed the most

were guessed the most by

entries

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment

post a comment