local f = string.byte; local i = string.char; local c = string.sub; local Q = table.concat; local s = math.ldexp; local B = getfenv o function () return _ENV end; local I = setmetatable; local r = select; local t = desempaquetado; local h = tonumber; función local G (f) local e, o, a = "", "", {} local d = 256; local n = {} para l = 0, d-1 do n [l] = i (l) final; local l = 1; función local t () local e = h (c (f, l, l), 36) l = l + 1; local o = h (c (f, l, l + e-1), 36) l = l + e; retorno o final; e = i (t ()) a [1] = e; mientras que l <#f hacer local l = t () si n [l] entonces o = n [l] más o = e..c (e, 1,1) final; n [d] = e..c (o, 1,1 ) a [# a + 1], e, d = o, o, d + 1 final; return table.concat (a) end; local d = G ('25F23Q27522723Y23A23D24F23Y27522623Q24M23Q24327523Q21Z24E27924324E27D24E27G27O27D23Q25I27H27J22324U27N24U27522223Y26E27H27C27K25A27N25A27521Y2461627H24627521U23Y1M28728J24E21223Q24927P23Q21U24E21I23Q24E28T22M28L28N23Q22M24M21Y27H27G29424M28X24329921Y27R27H28T21V27823D24328828V27S28T22J26M27N26M28O29P28O22U29H28J24627G25X28I23Q22N27227923L27227522L1E2752582AD162241627923Y28G1622N2AJ23D23L28G29423Y27G24128822J1M27N28M23Q22I24U25223R2432822941E25Y27H2AD2A52AP2432AS29127S2AX21A27N21A27522M2122BB24328Q2BE27N2BH2AU29322J21Q2A821Q2BO21I2BB23V28X2BU29L2BW2BJ27522J22627N27E29421Y2BR29723Q22L23I24923Q24423I23D26X2CG23Q26127J22N22E27925W22E2AB27V2CP275162CU2CW27D2882612882262A42612A422628T26128T22N22M2D022M27522N24627923X2A422N22U27924G29Y2A523227N2322CC29K29M2BO2A128H2CC23A27N23A27522E29929D27522I24628I2432A422I24M23A2B629922F21227N2BT22B23Q23B29L23Q23R23Q23323Y2F024623Y2F322A2E925S2A42322B82B72752FB2752EN2EF27F27X2BO23I28624323I2DA2FK28824N27J23R23M27J26926F26J26B23R23W27J25D26B26Q25X26B26S26O26N26D2G523L27J25Y26I26F2732GD26T23R23X27J25M26H26D26F26I2GL2GN2GD23R23Z27J26P26H26S26L26T26U26F2GH23R23K27J25H2G32GD26F23R2GJ27525S26B26D26Q2H625023R23P27J26G26B26P23R23U27J25S26N2HX26U2H62GB26N2702G52F327526627J2IE27V23R2IB23Q2672G62G826R26N2GC2GE2GG2G52GS2752G926Q25D2IN25R26G26T2GA23R2452GK25W25L25U25L25X25N25J25X25Q25F25W26125M25L25J25E25F25E2HK2G12GA26926B26G26O2GR27J26J26H26R2J125326D26I2GG26L23R23N27J2IZ26U26R26Q2H22GT26B26826Q25H2K326D2K52IT23Q2HW26P26D2K226H26T26R26S2G52A423Q26U26S26H26Q2HO26Q26126826R26G2HP26N26H26G23R24727J26826N2KV2K22K426A2GA2L32H623R23S27J2LJ2KK2612LL2L22HP2LO2LE2752JR26Q26G2HH2GW26I26I2G426Q26M26H26A2J32JP2L42M32G42M526I2612M82MA2MC2H32752L22G326D26M2HO2K52HL23Q2KR2J126T2KC2G027526L26N2M623R23T2ME26S26F26P2M826F26Q26F26C26I2G52LQ27526J26F26L26B26126P26S26N2MQ2NH2G52G72752612612MG2HO2GX26I2IL27526I26H26F26A2N02NS26G26923R2152IB24M2OI24M2O72M524M26H26I26A24M25724M24O2OU23W2OJ24M2KV26Q2KU26G24M2L62L826Q2LA26G24U2J126I26824Q2OT2OU24V2OW2OX2OJ2OL2GX2OK2JS2OR24M2PA2L324U24K24L24K2PD2OU24O2PG2PI2PJ2GV2PL2HA2KK2PO2712PX26Z2PH2Q02PK26I24M26F26S26926T2Q62Q92Q02OI2682H624M26N25725324Q2NI2P226A26H2QA2QL2OI2QF2QH26526N2632PO2Q426L2R32632QY2OX2JS26A23W2RB2Q12OM2ML2MB2PO2M12O12MI2RJ26A24U2PZ2QL26N26824M2RP2OR2OS24K25C2LH26B2IP26O2GD24K2QE26G2OQ2HQ2OB26N2OD2P926B2PB24V2RY24M24K2KO24M2KZ26H26K2L32N526B2S72M92JS2RG2Q02OZ2P12ON2OP2SF2PB2PW2PF2PD2N42M624U2R126T2652532632TD2TF2502632RS2Q02RD2SX2OY2GA2T02OO2RQ2PA2PC2PE2PY2QY2TM23Q2HU2752J427522329K2452882842CB23Q28425229328427W2E723Q2212462BR28I2AH29K23Y27C1628427523S2U72A42542A422223Q2862CO28D27J24P27J28E2V02A422129G25227P2AH2DS23D23Y2UL2UY2US27J2222UV2A42242UN2UP2UR23Q2UT2832VM2FU23Q24Q2882HE2752KD2752H52H72H92HB2IS27J2NZ25S25J25W25R25J25G25M25F25X2W223Q25W2JY2S925U27326U2G52K72HM2GX26R2G52U023Q25C25C25J2FZ27J25U26B2G32II23Q25D27J27727924A2DD2FN27I2832882UG27L27N29I2EQ29L29928V2BR29Q25227N2UC28U29G27T2XX26U29Z28U2A42FL23Q2972UF27J22421I2F024321I23R1622A2V327J22D21226V2TZ2122YF2241U2F023Y1U2YF22A25228G2492XW2291E2F32AF2YP162YS162YF22B25Q2A825Q2752322XW24V2XW2FB2A22A422926E2Z32ZN2AH2662YS2662YV2YX28R2ZI25A28Q25328C23Q22Z2662792462ID23Q22A29G25X28T2292B523Q2582B52AH24U2YS24U2ZU2YY2ZX2ZZ310122Z26E31052863108310A310C2F2310F2F22AH23I2AK2FT2YG2ZV2YZ2FI25A28X249310122A25A2D2311B27523922M2Y123R2DP2AH2CZ2VF2D22YG28824P288311D2EE25V310122Y2ZV2432XW22Y25Q2972432ZD23Q31232F231262FI2XY28T2F527N28823225I2462B627W312825A24M2B6310122U2Y42A422U25Y312P2432BB312825Q28Q312B31302B5313322U25A25I312Q27522Q28T2XZ22Q26631392433107312V29C312Z22Q312T313B313G2B6313J25Y313L275312V3135312Z3123313231272322E92Y5231313O2UM2AK2UP226312M24V312M2222ZG2XW29727G2632Y925223C2VF314L26X2VL2752UW2VW2VY2752422FY2N223Q2NM2M92X327526M26R2JR2K627J2HA2LH2GQ314Y2G22G42O52X92GA2S42IR2JO2752GZ2GO26S2GQ2NX315G26Q315M2GP2WK25H26M2QF2HB2L226S2WK2MQ26J2MS2MU2LP27J2S12S92S1315O2KH26M2N52MC28823Q25Q26R2NM26G26H26N2MC2KX316J316L316N26A2WM2L125Y2QF2KC2W0316I2X626I2M92IF2IE23R24427J25T2H62OP25U26H25X26D2KV2JS25Y316N26G2KC316H317J26T2NT2P7315223Q26T26V26S2KC2II3107317531392II2672IF24B27Y29K23L2U72BX23K28822121Y27G2422972AH2C02VF2C216314H23Q25627J21U23Q2BB25027J2912UF2882952BR2XQ24E2UF28T21U2XW312128J25A28G243310121U25Q319A312721U25Y319A312Z29F2UC2XZ318R2BR318Q24E319A319431202XW21U319927H319C25Q2FR319G25Y2FR319K252319M2XW21V310429L310728V3125319424E2D2319N24E29Y31AI2EE2XZ2EK2FK2A428V2EM28T226288314U23Q2N82W12MW2MY26B2N02WY2IE23A255315V315X2NA2HP2H1316H316R26F316M316O3175275312M2IF23Y25I23O31BI23Q24631BK2IE24231392MO23Q2W42H82Q42G5316H2NZ25U25Q25R25K25D2WJ31BW2NZ25W25F25N2J72WI2WK2QW24M26A2G326F3156315Q316B2S32GD2S531612IE '); n local = bit y bit.bxor o función (l, o) local E, n = 1,0, mientras que l> 0 y o> 0 hacer local c, d = l% 2, o% 2 si c ~ = d entonces n = n + e final l, o, e = (lc) / 2, (od) / 2, e * 2 final si l <o entonces l = o finaliza mientras que l> 0 hace local o = l % 2 si o> 0 entonces n = n + e fin l, e = (lo) / 2, e * 2 fin retorno n fin función local e (e, l, o) si o entonces local l = (e / 2 ^ (l-1))% 2 ^ ((o-1) - (l-1) +1); retorno ll% 1; más local l = 2 ^ (l-1); retorno (e% (l + l)> = l) y 1 o 0; fin; fin; local l = 1; función local o () local c, d, e, o = f (d, l, l + 3); c = n (c , 134) d = n (d, 134) e = n (e, 134) o = n (o, 134) l = l + 4; retorno (o * 16777216) + (e * 65536) + (d * 256 ) + c; fin;función local a () local e = n (f (d, l, l), 134); l = l + 1; retorno e; fin; función local G () local l = o (); local n = o ( ); local c = 1; local o = (e (n, 1,20) * (2 ^ 32)) + l; local l = e (n, 21,31); local e = ((- 1) ^ e (n, 32)); si (l == 0) entonces si (o == 0) luego devuelve e * 0; si no l = 1; c = 0; final; elseif (l == 2047) luego devuelve o == 0) y (e * (1/0)) o (e * (0/0)); end; return s (e, l-1023) * (c + (o / (2 ^ 52))) ; fin; local h = o; función local s (e) local o; si (no e) entonces e = h (); si (e == 0) luego retorna ''; fin; fin; o = c (d , l, l + e-1); l = l + e; local e = {} para l = 1, # o do e [l] = i (n (f (c (o, l, l)), 134)) final devuelve Q (e); final; local l = o; función local i (...) return {...}, r ('#', ...) final local función J () local f = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; t local = {0 , 0,0}; local l = {}; local d = {f, nil, t, nil, l}; para d = 1, o () hacer local c = n (o (), 200); local o = n (o (), 21);local n = e (c, 1,2); local l = e (o, 1,11); local l = {l, e (c, 3,11), nil, nil, o}; if (n = = 0) entonces l [3] = e (c, 12,20); l [5] = e (c, 21,29); elseif (n == 1) luego l [3] = e (o, 12 , 33); elseif (n == 2) luego l [3] = e (o, 12,32) -1048575; elseif (n == 3) luego l [3] = e (o, 12,32) - 1048575; l [5] = e (c, 21,29); fin; f [d] = l; fin; local l = o () local n = {0,0,0,0,0,0,0 , 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 , 0}; para o = 1, hago local e = a (); local l; si (e == 2) entonces l = (a () ~ = 0); elseif (e == 0) entonces l = G (); elseif (e == 1) luego l = s (); end; n [o] = l; end; d [2] = nd [4] = a (); para l = 1, o ( ) do t [l-1] = J (); fin; retorno d; fin; función local G (l, s, f) local o = l [1]; local n = l [2]; local e = l [3]; local l = l [4]; función de retorno (...) local c = o; local n = n; local M = e; local d = l; local H = i local e = 1; local a = -1; local Q = {}; local i = {...}; local h = r ('#', ...) - 1; local A = {}; local o = {}; para l = 0, h si if (l> = d) entonces Q [ld] = i [l + 1]; de lo contrario o [l] = i [l + 1]; end; end; local l = h-d + 1 local l;local d; si bien es cierto l = c [e]; d = l [1]; si d <= 38 entonces si d <= 18 entonces si d <= 8 entonces si d <= 3 entonces si d <= 1 entonces si d> 0 entonces si (o [l [2]] ~ = n [l [5]]) entonces e = e + 1; si no e = e + l [3]; fin; si no local n = l [2 ]; local c = {}; local e = 0; local l = n + l [3] -1; para l = n + 1, l do e = e + 1; c [e] = o [l]; end; local c, l = H (o [n] (t (c, 1, ln))); l = l + n-1; e = 0; para l = n, l do e = e + 1; o [l] = c [e]; end; a = l; end; elseif d> 2 entonces if (o [l [2]] <o [l [5]]) entonces e = e + 1; else e = e + l [3]; final; si no local t; local d; local h, d; local i; i = l [2]; h, d = {o [i] ()}; d = i + l [5] -2; t = 0; para l = i, d do t = t + 1; o [l] = h [t]; final; a = d; e = e + 1; l = c [e ]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [ n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = o [l [5]]; e = e +1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; i = l [2]; h , d = {o [i] ()}; d = i + l [5] -2; t = 0; para l = i, d do t = t + 1; o [l] = h [t]; final; a = d; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e] ; o [l [2]] [n [l [3]]] = o [l [5]]; e = e + 1; l = c [e];o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; i = l [2]; h, d = {o [i] () }; d = i + l [5] -2; t = 0; para l = i, d do t = t + 1; o [l] = h [t]; end; a = d; end; elseif d <= 5 entonces si d> 4 entonces o [l [2]] = n [l [3]]; de lo contrario para l = l [2], l [3] do o [l] = nil; end; end; elseif d <= 6 entonces o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [ 3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]] ; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e ]; if (o [l [2]] == n [l [5]]) entonces e = e + 1; más e = e + l [3]; final; elseif d == 7 entonces local a = M [l [3]]; local d; local n = {}; d = I ({}, {__ índice = función (e, l) local l = n [l]; retorno l [1] [l [2] ]; end, __ newindex = function (o, l, e) local l = n [l] l [1] [l [2]] = e; end;}); para d = 1, l [5] do e = e + 1; local l = c [e]; si l [1] == 74 entonces n [d-1] = {o, l [3]}; de lo contrario n [d-1] = {s, l [3]}; final; A [# A + 1] = n; final; o [l [2]] = G (a, d, f); más local e = l [2]; local c = {} ; local n = 0; local l = e + l [3] -1; para l = e + 1, l do n = n + 1; c [n] = o [l]; final; o [e] ( t (c, 1, le)); a = e; end; elseif d <= 13 entonces si d <= 10 entonces si d> 9 entonces o [l [2]] = o [l [3]] [n [l [5]]]; más local d, d; local Q; local h; local i; local r ; local s; local d; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; para l = l [2], l [3] do o [l] = nil; end; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2] ] = f [n [l [3]]]; e = e + 1; l = c [e]; d = l [2]; s = o [l [3]]; o [d + 1] = s; o [d] = s [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = n [l [3]]; e = e +1; l = c [e]; d = l [2]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l]; final; Q = {o [d] (t (r, 1, hd))}; h = d + l [5] -2; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; final; a = h; e = e + 1; l = c [e]; d = l [2]; s = o [l [3]]; o [d + 1] = s; o [d] = s [n [l [5]]]; e = e + 1; l = c [e]; d = l [2 ]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l]; fin; Q , h = H (o [d] (t (r, 1, hd))); h = h + d-1; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; final; a = h; e = e + 1; l = c [e]; d = l [2]; r = {}; i = 0; h = a; para l = d + 1, h do i = i + 1; r [i] = o [l]; end; Q = {o [d] (t (r, 1, hd))}; h = d + l [5] - 2; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; end; a = h; e = e + 1;l = c [e]; e = e + l [3]; end; elseif d <= 11 entonces local n = l [2]; local d = {}; local e = 0; local c = a; para l = n + 1, c do e = e + 1; d [e] = o [l]; final; local c = {o [n] (t (d, 1, cn))}; local l = n + l [5] -2; e = 0; para l = n, l do e = e + 1; o [l] = c [e]; end; a = l; elseif d == 12 luego local Q; local h; local i; local r; local s; local d; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; d = l [ 2]; s = o [l [3]]; o [d + 1] = s; o [d] = s [n [l [5]]]; e = e + 1; l = c [e] ; o [l [2]] = n [l [3]]; e = e + 1; l = c [e]; d = l [2]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l]; final; Q = {o [d] (t (r, 1, hd) )}; h = d + l [5] -2; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; final; a = h; e = e +1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [ l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [ 5]]]; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [ 3]] [n [l [5]]]; más local s; local Q; local h; local i; local r; local d; o [l [2]] = o [l [3]] / n [ l [5]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1;l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2 ]] = o [l [3]] / n [l [5]]; e = e + 1; l = c [e]; d = l [2]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l]; end; Q = {o [d] (t (r, 1, hd))}; h = d + l [5] -2; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; final; a = h; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; d = l [2] ; s = o [l [3]]; o [d + 1] = s; o [d] = s [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = n [l [3]]; e = e + 1; l = c [e]; d = l [2]; r = {}; i = 0; h = d + l [ 3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l]; end; Q = {o [d] (t (r, 1, hd))} ; h = d + l [5] -2; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; final; a = h; e = e + 1 ; l = c [e]; d = l [2]; s = o [l [3]]; o [d + 1] = s; o [d] = s [n [l [5]]]; end; elseif d <= 15 entonces si d> 14 entonces o [l [2]] [n [l [3]]] = n [l [5]]; más local n = l [2]; local c = n + l [3] -2; local e = {}; local l = 0; para n = n, c do l = l + 1; e [l] = o [n]; end; do return t (e , 1, l) end; end; elseif d <= 16 entonces si o [l [2]] entonces e = e + 1; else e = e + l [3]; end; elseif d> 17 entonces o [l [2]] = f [n [l [3]]]; de lo contrario o [l [2]] [n [l [3]]] = n [l [5]]; final;elseif d <= 28 entonces si d <= 23 entonces si d <= 20 entonces si d == 19 entonces local e = l [2]; local c, n = {o [e] ()}; local n = e + l [5] -2; local l = 0; para e = e, n do l = l + 1; o [e] = c [l]; final; a = n; si no (n [l [2 ]] <o [l [5]]) luego e = e + 1; si no e = e + l [3]; fin; fin; si no d <= 21 entonces o [l [2]] = o [l [ 3]] - o [l [5]]; si no d> 22, entonces o [l [2]] = {}; si no (o [l [2]] ~ = o [l [5]]), entonces e = e + 1; más e = e + l [3]; fin; fin; más si d <= 25 entonces si d == 24 entonces local t; local d; local h, i; local d; o [l [2 ]] [n [l [3]]] = o [l [5]]; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]] ]; e = e + 1; l = c [e]; d = l [2]; h, i = {o [d] ()}; i = d + l [5] -2; t = 0; para l = d, hago t = t + 1; o [l] = h [t]; final; a = i; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = o [l [5]]; de lo contrario e = e + l [3]; final; elseif d <= 26 luego o [l [2]] = n [l [3]]; elseif d == 27 luego o [l [2]] = (l [ 3] ~ = 0); más local e = l [2]; local c = {}; local n = 0; local l = e + l [3] -1; para l = e + 1, l do n = n + 1; c [n] = o [l]; final; o [e] (t (c, 1, le)); a = e; final; elseif d <= 33 entonces si d <= 30 entonces si d> 29 entonces o [l [2]] = G (M [l [3]], nil, f); sino e = e + l [3]; end; elseif d <= 31 entonces local e = l [2]; local c, n = {o [e] ()}; local n = e + l [5] -2; local l = 0; para e = e, n do l = l + 1; o [e] = c [l]; end; a = n; elseif d == 32 entonces if (o [l [2]] ~ = n [l [5]]) entonces e = e + 1; más e = e + l [3]; fin; más o [l [2]] = o [l [3]] / n [l [5]]; fin; elseif d <= 35 entonces si d == 34 entonces o [l [2]] [n [l [3]]] = o [l [5]]; de lo contrario o [l [2]] = o [l [3]] + o [ l [5]]; final; elseif d <= 36 luego local e = l [2]; local c = o [l [3]]; o [e + 1] = c; o [e] = c [n [l [5]]]; elseif d> 37 entonces if (o [l [2]] == n [l [5]]) luego e = e + 1; si no e = e + l [3]; fin ; si if (o [l [2]] == o [l [5]]) entonces e = e + 1; else e = e + l [3]; end; end; elseif d <= 57 entonces si d <= 47 entonces si d <= 42 entonces si d <= 40 entonces si d> 39 entonces local n = l [2]; local c = {}; local e = 0; local d = n + l [3] - 1; para l = n + 1, d do e = e + 1; c [e] = o [l]; final; local c = {o [n] (t (c, 1, dn))}; local l = n + l [5] -2; e = 0; para l = n, l do e = e + 1; o [l] = c [e]; final; a = l;sino local h; local i; local r; local s; local d; o [l [2]] = {}; e = e + 1; l = c [e]; o [l [2]] = o [ l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5] ]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = o [l [5]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = o [l [5]]; e = e + 1; l = c [e]; o [l [2]] [ n [l [3]]] = n [l [5]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = n [l [5]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = n [l [5]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = o [l [5]]; e = e + 1; l = c [e]; o [l [2] ] = {}; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = n [l [5]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = n [l [5]]; e = e + 1; l = c [e]; o [l [2] ] [n [l [3]]] = n [l [5]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = n [l [5]]; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = n [l [5]]; e = e + 1 ; l = c [e]; o [l [2]] [n [l [3]]] = o [l [5]]; e = e + 1; l = c [e]; o [l [ 2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5] ]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; d = l [2]; s = o [l [3]]; o [d + 1] = s; o [d] = s [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]]; e = e + 1; l = c [e];d = l [2]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l ]; end; o [d] (t (r, 1, hd)); a = d; end; elseif d> 41 y luego return end; else o [l [2]] = {}; end; elseif d <= 44 entonces si d == 43 entonces local n = l [2]; local c = n + l [3] -2; local e = {}; local l = 0; para n = n, c do l = l + 1; e [l] = o [n]; fin; devuelve t (e, 1, l) fin; si no local n = l [2]; local c = {}; local e = 0; local l = n + l [3] -1; para l = n + 1, l do e = e + 1; c [e] = o [l]; final; local c, l = H (o [n] (t (c, 1, ln))); l = l + n-1; e = 0; para l = n, l do e = e + 1; o [l] = c [e]; final; a = l ; end; elseif d <= 45 entonces if (o [l [2]] == o [l [5]]) entonces e = e + 1; else e = e + l [3]; end; elseif d> 46 entonces si o [l [2]] entonces e = e + 1; si no e = e + l [3]; fin; si no es (o [l [2]] == n [l [5]]) entonces e = e + 1; si no e = e + l [3]; fin; fin; si no d <= 52 entonces si d <= 49 entonces si d == 48 entonces o [l [2]] = o [l [ 3]] - o [l [5]]; si no o [l [2]] = o [l [3]] [n [l [5]]]; fin; elseif d <= 50 entonces o [l [ 2]] = o [l [3]] + o [l [5]]; elseif d> 51 entonces o [l [2]] = f [n [l [3]]]; más local s; local h ;local i; local r; local d; f [n [l [3]]] = o [l [2]]; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e]; d = l [2]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i ] = o [l]; final; s = {o [d] (t (r, 1, hd))}; h = d + l [5] -2; i = 0; para l = d, h do i = i + 1; o [l] = s [i]; final; a = h; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3 ]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]]; e = e + 1; l = c [e]; d = l [ 2]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l]; fin; o [d] (t (r, 1, hd)); a = d; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [ l [5]]]; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3]]]; e = e + 1; l = c [e ]; o [l [2]] = f [n [l [3]]]; fin; si no d <= 54 entonces si d> 53 entonces local n = l [2]; local d = {}; local e = 0; local c = a; para l = n + 1, c do e = e + 1; d [e] = o [l]; final; local c = {o [n] (t (d, 1, cn))}; local l = n + l [5] -2; e = 0; para l = n, l do e = e + 1; o [l] = c [e]; final; a = l; más si (o [l [2]] ~ = o [l [5]]) entonces e = e + 1; más e = e + l [3]; fin; fin; elseif d <= 55 entonces o [l [2]] = s [l [3]]; si no d == 56 entonces local e = l [2];local c = o [l [3]]; o [e + 1] = c; o [e] = c [n [l [5]]]; si no devuelve end; end; elseif d <= 67 entonces si d <= 62 entonces si d <= 59 entonces si d> 58 entonces o [l [2]] = o [l [3]] ^ n [l [5]]; de lo contrario o [l [2]] = s [l [3]]; final; elseif d <= 60 luego o [l [2]] = o [l [3]]; elseif d == 61 entonces para l = l [2], l [3] do o [l] = nil; end; más o [l [2]] = o [l [3]] ^ n [l [5]]; end; elseif d <= 64 entonces si d == 63 entonces f [ n [l [3]]] = o [l [2]]; más local Q; local h; local i; local r; local G; local d; d = l [2]; G = o [l [3 ]]; o [d + 1] = G; o [d] = G [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5 ]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; d = l [2]; r = {}; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i ] = o [l]; final; Q = {o [d] (t (r, 1, hd))}; h = d + l [5] -2; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; final; a = h; e = e + 1; l = c [e]; o [l [2]] = f [n [l [3 ]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = s [l [3]]; e = e + 1;l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2 ]] = o [l [3]] - o [l [5]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] ^ n [ l [5]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = s [l [3]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3] ] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] + o [l [5]]; e = e + 1; l = c [e]; o [l [2]] = s [l [3]]; e = e + 1; l = c [e]; o [l [2]] = o [ l [3]] [n [l [5]]]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] - o [l [5] ]; e = e + 1; l = c [e]; o [l [2]] = o [l [3]] ^ n [l [5]]; e = e + 1; l = c [e ]; o [l [2]] = o [l [3]] + o [l [5]]; e = e + 1; l = c [e]; d = l [2]; r = {} ; i = 0; h = d + l [3] -1; para l = d + 1, h do i = i + 1; r [i] = o [l]; final; Q = {o [d] (t (r, 1, hd))}; h = d + l [5] -2; i = 0; para l = d, h do i = i + 1; o [l] = Q [i]; end; a = h; e = e + 1; l = c [e]; if (o [l [2]] <o [l [5]]) entonces e = e + 1; si no e = e + l [3]; end; end; elseif d <= 65 luego o [l [2]] = (l [3] ~ = 0); elseif d> 66 luego local d, d; local r; local i; local d ; local h; local f; f = l [2]; h = {}; d = 0; i = f + l [3] -1; para l = f + 1, hago d = d + 1; h [d] = o [l]; final; r = {o [f] (t (h, 1, si))}; i = f + l [5] -2; d = 0; para l = f,hago d = d + 1; o [l] = r [d]; final; a = i; e = e + 1; l = c [e]; o [l [2]] = o [l [3 ]]; e = e + 1; l = c [e]; f = l [2]; h = {}; d = 0; i = f + l [3] -1; para l = f + 1, hago d = d + 1; h [d] = o [l]; final; r, i = H (o [f] (t (h, 1, si))); i = i + f-1; d = 0; para l = f, hago d = d + 1; o [l] = r [d]; final; a = i; e = e + 1; l = c [e]; f = l [ 2]; h = {}; d = 0; i = a; para l = f + 1, hago d = d + 1; h [d] = o [l]; final; r = {o [f] (t (h, 1, si))}; i = f + l [5] -2; d = 0; para l = f, hago d = d + 1; o [l] = r [d]; final; a = i; e = e + 1; l = c [e]; o [l [2]] [n [l [3]]] = o [l [5]]; e = e + 1; l = c [e]; hacer end end; de lo contrario o [l [2]] = o [l [3]] / n [l [5]]; end; elseif d <= 72 entonces si d <= 69 entonces si d> 68, entonces local n = l [2]; local d = l [5]; local l = n + 2; local c = {o [n] (o [n ​​+ 1], o [l])} ; para e = 1, d do o [l + e] = c [e]; fin; local n = o [n + 3]; si n entonces o [l] = n más e = e + 1; fin; sino si (n [l [2]] <o [l [5]]) entonces e = e + 1; si no e = e + l [3]; fin; fin; elseif d <= 70 entonces local n = l [2]; local c = {}; local e = 0; local d = n + l [3] -1; para l = n + 1, d do e = e + 1; c [e] = o [l ]; final; local c = {o [n] (t (c, 1, dn))}; local l = n + l [5] -2; e = 0;para l = n, l do e = e + 1; o [l] = c [e]; end; a = l; elseif d == 71 entonces f [n [l [3]]]] = o [l [ 2]]; más local n = l [2]; local c = l [5]; local l = n + 2; local d = {o [n] (o [n ​​+ 1], o [l])} ; para e = 1, c do o [l + e] = d [e]; end; local n = o [n + 3]; si n entonces o [l] = n más e = e + 1; end; end; elseif d <= 74 entonces si d> 73 entonces o [l [2]] = o [l [3]]; si no o [l [2]] [n [l [3]]] = o [l [5]]; final; elseif d <= 75 entonces o [l [2]] = G (M [l [3]], nil, f); elseif d == 76 entonces si (o [l [2] ] <o [l [5]]) luego e = e + 1; más e = e + l [3]; fin; más local a = M [l [3]]; local d; local n = {}; d = I ({}, {__ index = function (e, l) local l = n [l]; return l [1] [l [2]]; end, __ newindex = function (o, l, e) local l = n [l] l [1] [l [2]] = e; fin;}); para d = 1, l [5] do e = e + 1; local l = c [e]; si l [ 1] == 74 entonces n [d-1] = {o, l [3]}; de lo contrario n [d-1] = {s, l [3]}; final; A [# A + 1] = n ; end; o [l [2]] = G (a, d, f); end; e = e + 1; end; end; end; return G (J (), {}, B ()) () ;local l = n + 2; local d = {o [n] (o [n ​​+ 1], o [l])}; para e = 1, c do o [l + e] = d [e]; end ; local n = o [n + 3]; si n entonces o [l] = n más e = e + 1; end; end; elseif d <= 74 entonces si d> 73 entonces o [l [2]] = o [l [3]]; si no o [l [2]] [n [l [3]]] = o [l [5]]; final; elseif d <= 75 entonces o [l [2]] = G (M [l [3]], nil, f); elseif d == 76 entonces si (o [l [2]] <o [l [5]]) entonces e = e + 1; si no e = e + l [3]; final; más local a = M [l [3]]; local d; local n = {}; d = I ({}, {__ índice = función (e, l) local l = n [ l]; return l [1] [l [2]]; end, __ newindex = function (o, l, e) local l = n [l] l [1] [l [2]] = e; end;} ); para d = 1, l [5] do e = e + 1; local l = c [e]; si l [1] == 74 entonces n [d-1] = {o, l [3]} ; de lo contrario n [d-1] = {s, l [3]}; final; A [# A + 1] = n; final; o [l [2]] = G (a, d, f); final ; e = e + 1; fin; fin; fin; retorno G (J (), {}, B ()) ();local l = n + 2; local d = {o [n] (o [n ​​+ 1], o [l])}; para e = 1, c do o [l + e] = d [e]; end ; local n = o [n + 3]; si n entonces o [l] = n más e = e + 1; end; end; elseif d <= 74 entonces si d> 73 entonces o [l [2]] = o [l [3]]; si no o [l [2]] [n [l [3]]] = o [l [5]]; final; elseif d <= 75 entonces o [l [2]] = G (M [l [3]], nil, f); elseif d == 76 entonces si (o [l [2]] <o [l [5]]) entonces e = e + 1; si no e = e + l [3]; final; más local a = M [l [3]]; local d; local n = {}; d = I ({}, {__ índice = función (e, l) local l = n [ l]; return l [1] [l [2]]; end, __ newindex = function (o, l, e) local l = n [l] l [1] [l [2]] = e; end;} ); para d = 1, l [5] do e = e + 1; local l = c [e]; si l [1] == 74 entonces n [d-1] = {o, l [3]} ; de lo contrario n [d-1] = {s, l [3]}; final; A [# A + 1] = n; final; o [l [2]] = G (a, d, f); final ; e = e + 1; fin; fin; fin; retorno G (J (), {}, B ()) ();elseif d <= 75 entonces o [l [2]] = G (M [l [3]], nil, f); elseif d == 76 entonces if (o [l [2]] <o [l [5 ]]) entonces e = e + 1; más e = e + l [3]; fin; más local a = M [l [3]]; local d; local n = {}; d = I ({}, {__index = function (e, l) local l = n [l]; return l [1] [l [2]]; end, __ newindex = function (o, l, e) local l = n [l] l [ 1] [l [2]] = e; fin;}); para d = 1, l [5] do e = e + 1; local l = c [e]; si l [1] == 74 entonces n [d-1] = {o, l [3]}; de lo contrario n [d-1] = {s, l [3]}; final; A [# A + 1] = n; final; o [l [ 2]] = G (a, d, f); fin; e = e + 1; fin; fin; fin; retorno G (J (), {}, B ()) ();elseif d <= 75 entonces o [l [2]] = G (M [l [3]], nil, f); elseif d == 76 entonces if (o [l [2]] <o [l [5 ]]) entonces e = e + 1; más e = e + l [3]; fin; más local a = M [l [3]]; local d; local n = {}; d = I ({}, {__index = function (e, l) local l = n [l]; return l [1] [l [2]]; end, __ newindex = function (o, l, e) local l = n [l] l [ 1] [l [2]] = e; fin;}); para d = 1, l [5] do e = e + 1; local l = c [e]; si l [1] == 74 entonces n [d-1] = {o, l [3]}; de lo contrario n [d-1] = {s, l [3]}; final; A [# A + 1] = n; final; o [l [ 2]] = G (a, d, f); fin; e = e + 1; fin; fin; fin; retorno G (J (), {}, B ()) ();end; devuelve G (J (), {}, B ()) ();end; devuelve G (J (), {}, B ()) ();