API tools faq
paste
1FoScripts

Untitled

1FoScripts
Apr 25th, 2025
60
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 70.76 KB | None | 0 0
raw download clone embed print report
  1. ([
  2. [This file was protected with MoonSec V3]
  3. ]): gsub('.+', (function(a) _hKzzjtQEFHls = a; end));
  4. return (function(f, ...) local r; local t; local c; local h; local d; local l; local e = 24915; local n = 0; local s = {};
  5. while n < 571 do n = n + 1; while n < 0x21d and e % 0x3ee6 < 0x1f73 do n = n + 1 e = (e - 479) % 24918 local p = n + e
  6. if (e % 0x310c) > 0x1886 then e = (e * 0x376) % 0x4ccf
  7. while n < 0x269 and e % 0x1fde < 0xfef do n = n + 1 e = (e + 56) % 43536 local t = n + e
  8. if (e % 0x1c52) >= 0xe29 then e = (e - 0xa2) % 0x8fbd local e = 8433
  9. if
  10. not s[e] then s[e] = 0x1 end elseif e % 2~ = 0 then e = (e + 0xfd) % 0xa23f local e = 14412
  11. if not s[e] then s[e] = 0x1 end
  12. else e = (e - 0x3c6) % 0x9e76 n = n + 1 local e = 22774
  13. if not s[e] then s[e] = 0x1 d = function(s) local e = 0x01 local
  14. function n(n) e = e + n
  15. return s: sub(e - n, e - 0x01) end
  16. while true do local s = n(0x01) if (s == "\5") then
  17. break end local e = l.byte(n(0x01)) local e = n(e) if s == "\2"
  18. then e = h.xIYmPPcm(e) elseif s == "\3"
  19. then e = e~ = "\0"
  20. elseif s == "\6"
  21. then r[e] = function(n, e) return f(8, nil, f, e, n) end elseif s == "\4"
  22. then e = r[e] elseif s == "\0"
  23. then e = r[e][n(l.byte(n(0x01)))]; end local n = n(0x08) h[n] = e end end end end end elseif e % 2~ = 0 then e = (e + 0xa3) % 0x70c8
  24. while n < 0xcc and e % 0x4736 < 0x239b do n = n + 1 e = (e - 802) % 37147 local d = n + e
  25. if (e % 0x485a) < 0x242d then e = (e + 0x23) % 0xbc1e local e = 26032
  26. if
  27. not s[e] then s[e] = 0x1 l = string; end elseif e % 2~ = 0 then e = (e * 0x2d) % 0x6558 local e = 65688
  28. if not s[e] then s[e] = 0x1 h = {}; end
  29. else e = (e - 0x176) % 0x45b8 n = n + 1 local e = 14799
  30. if not s[e] then s[e] = 0x1 r = getfenv and getfenv(); end end end
  31. else e = (e + 0x126) % 0x76cd n = n + 1
  32. while n < 0x3b4 and e % 0x293e < 0x149f do n = n + 1 e = (e - 1023) % 13849 local d = n + e
  33. if (e % 0x9b4) >= 0x4da then e = (e + 0x308) % 0x333f local e = 52599
  34. if
  35. not s[e] then s[e] = 0x1 t = "\4\8\116\111\110\117\109\98\101\114\120\73\89\109\80\80\99\109\0\6\115\116\114\105\110\103\4\99\104\97\114\95\82\109\113\109\90\84\122\0\6\115\116\114\105\110\103\3\115\117\98\76\81\99\88\109\85\95\102\0\6\115\116\114\105\110\103\4\98\121\116\101\112\121\98\118\80\115\81\105\0\5\116\97\98\108\101\6\99\111\110\99\97\116\118\104\82\101\107\113\111\77\0\5\116\97\98\108\101\6\105\110\115\101\114\116\84\77\114\108\111\102\110\119\5"; end elseif e % 2~ = 0 then e = (e - 0x29f) % 0x225 local e = 54371
  36. if not s[e] then s[e] = 0x1 r = (not r) and _ENV or r; end
  37. else e = (e - 0xde) % 0xbc0e n = n + 1 local e = 78009
  38. if not s[e] then s[e] = 0x1 c = tonumber; end end end end end e = (e + 239) % 4920 end d(t); local e = {};
  39. for n = 0x0, 0xff do local s = h._RmqmZTz(n);
  40. e[n] = s; e[s] = n; end local
  41. function p(n) return e[n]; end local o = (function(t, l) local f, s = 0x01, 0x10 local n = {
  42. {},
  43. {},
  44. {}
  45. }
  46. local r = -0x01 local e = 0x01 local d = t
  47. while true do n[0x03][h.LQcXmU_f(l, e, (function() e = f + e
  48. return e - 0x01 end)())] = (function() r = r + 0x01
  49. return r end)() if r == (0x0f)
  50. then r = ""
  51. s = 0x000
  52. break end end local r = #l
  53. while e < r + 0x01 do n[0x02][s] = h.LQcXmU_f(l, e, (function() e = f + e
  54. return e - 0x01 end)()) s = s + 0x01
  55. if
  56. s % 0x02 == 0x00 then s = 0x00 h.TMrlofnw(n[0x01], (p((((n[0x03][n[0x02][0x00]] or 0x00) * 0x10) + (n[0x03][n[0x02][0x01]] or 0x00) + d) % 0x100))); d = t + d; end end
  57. return h.vhRekqoM(n[0x01]) end); d(o(208, "?)!GKp8+RkP_xX%#Gp")); d(o(155, "HsNFCG4wdE:!()KU4G)-:Npd4!(wFsdUEsG4((NEEs)sGU!wNKdEK)C4!U!NsdKdCW:FsFwd!:Nd:disw):)s4dGE:XF)FF:E47B4!)8sdEd()CC(4Ns4:dCKU(sNwd:K4G<:K!swK)wCU:F,)Gs)NCF:ER4wG!:sUFNE!4E(NF:EFEG4s!KNCE(UEGd(:U:wF((N)(FN%s:dwGF::sKw()EC)EUsw4E(UFKE(PFG:!(N(ECQwCE)F(dFXKCGd!!FsEsUEsU!!NN4s(GGC!-NE4)w)KN!:hEw4K4CKdGBNGD!4F):dgYfs4G*Ndwl)Cw:4N)wK)dGGG:(FECUCG)(FN4dNK(C:d:0Cw:!KCCECsNdCwZ)::Kp&44)GFFFEM)4!)NNddUU(Gw)Chw44K!Gs:)lsNNdEG)!!NNwd)UC(!CUwdF!UC4:FsK4)wN)d:d+U4!)GCodwKEwN)w/)wEKF4NG)(CE4K)GE!ws:En)CN(E:e^4CK!C:dK:EsNK?FE!s*:a()NF):Gz:wN!)FEEUnNGN:GFwwGEN")); local e = (-23192 + (function() local d, e = 0, 1;
  58. (function(e, n, s, r) e(e(n, e, s, e), s(e, n, s, n) and n(s, e, r, e), n(n, r, n, s), e(s, n, e, s)) end)(function(r, l, s, n) if d > 169 then
  59. return r end d = d + 1 e = (e * 316) % 26564
  60. if (e % 458) >= 229 then e = (e + 982) % 36172
  61. return s
  62. else return n(r(s, n, n, l), s(l, s, r, s and s), l(n, r, s, n), s(r, r, s, n) and n(r, n, n and l, l)) end
  63. return n(n(n, s, s, r), l(s, n, r, n), r(r, l, r, s), n(r, s, n, n)) end,
  64. function(l, n, s, r) if d > 479 then
  65. return r end d = d + 1 e = (e + 452) % 15921
  66. if (e % 434) <= 217 then e = (e - 723) % 5629
  67. return s(r(l, n and r, s and s, s), s(n, r, s, l), l(n, l, r and n, n and n), n(r, l, s, s))
  68. else return n end
  69. return l end,
  70. function(n, s, l, r) if d > 210 then
  71. return n end d = d + 1 e = (e * 125) % 10041
  72. if (e % 496) > 248 then e = (e + 348) % 38629
  73. return n(l(s, s, l, n), r(s, r, n, s and n), n(n, n, r, s), l(n, r and r, n, r))
  74. else return l end
  75. return s end,
  76. function(n, s, r, l) if d > 218 then
  77. return n end d = d + 1 e = (e - 498) % 45605
  78. if (e % 784) > 392 then
  79. return s(n(n, l, l, n), s(r and r, s, s, r), s(n, s, n, n and n), n(s, r, r, r))
  80. else return s end
  81. return n end) return e; end)()) local de = (getfenv) or(function() return _ENV end); local p = h.nLsJldzd or h.ayGAabYH; local r = 2; local m = 1; local t = 4; local d = 3; local
  82. function ne(b, ...) local a = o(e, "h s16*%<?T-N8p#r6r18*-<?TTpNpsr_j#?LNsp rT86s?6T%-? *-8rp<V<ps69%Y<NT#-p8Tr?V<s6r#<1?1-8N#T6pr r1p*-*p?p-T?6p?p18 #6r- ?1%T*p%r6r-sp68%pTs6<%8?:T#N86%%<<<T?8*#69j *1?6rDTsN6s%9<#/rs%6 *-<T-6? < TZ--8?#%%-?#- 8*<rT#N?p%r6*NT#N<#U?pN 8%#6Qs%1-%Np#8rT T6?*<?s1 * %-??-%1-61%8T1- *8<?T%N6psrQR#*8?-%NTr-68s#^6N?N-T8%8TrT *sr6 ?>T8N p6#N *K?6<%;<#Tp86N*j%s66G#r %s?6%%6pTZ s<*o6_?<-?T<p-rT -17#p %s%66%s8%F<s-1#1#<r-%8*#6p 611*6%-s<6r%t<#T8+81p%6<?T<8s8 b{or1?*%%T?%61%T<8T-N? p%1?%Tr%#8OU1XN1**1<fs16?*8<-T?P?6T%=%1T1N##5r GTsT#*W- #18*-NrrNs?s***?f-sN18N#N-<8-#ur# 8TpNT#sEi 61 * <<spT6%%?6-ss?*s<k?--NT5-18 sssr%11??r-rp?#- *sH* %p<p-?N<# r#ss1 *?<8*6-<p #p8ps?61*p<?TT86#6= s6rT18<*T%-1?p8-F* 86-*<?%-N<rpN#p 11% *<<T6-1?p#?I1 -6?**?6-TN8p F -Npz#6_ss;?.8?#TrNs 6< s**? T8%p?#-%86#s<6?p-18 #6rNN<p8r4_#s8- 8TrsHr#s11%#? TrN8<TTpNspS##6p?#-8NTrc>Ns661%# p1r*%<6Tsr611*r<#T-N*pp?*-<N#p8r-*N-*8s#Er* 6g#p s%66%s8 yssFs#%<<pTNN#p*T 8s8-#?t%<T-#p6#<;T N68*N16<rNTp8r* ?srB%*?TN-18p#Nt?NNprr6 s1>T*pNr# <#%1<%-?r-#*r?1T?N%p611<6Ts?#prr8 -11*{)1s118*-<?,Ts?11%6<1sr*1%??%-6 *6*%-??*--<#?rTs*p1rsK8s-6?p-#T -16#,r8 -1?*%<6TsQTl##r s?6%%6ps08 r***r?--T*<<pTA-#881%<<?T-*8#p23- p*1*p??1**s<1T*-88-#?6TT1N68*8* s1pNfu 61s*=8srN 8sT1T%<T6-T8#raTpN8p%r6 s?<-rp*r#-N8r#6=ssD?*8N##I<p%s *N<#T16r<-??-%86s-<*?NTp8?#<rr ?s6*r<p-BT-8Tr? ?8*#8r# 81-TN#?rT 166*1%1T1N%8-r1 T81#8r8 -1?TTp8r1sssr6r<#?pN?-*#%k6s16Srp #1%*6<srss16d*#<<T66<%r?mT#N81T%j% -#88p-Isrp/rs#6#T{N*%1?sT8N-p?*p<*TrN*< ?r--8?#%< ?1N?% ?#T-N?p%6p? -*-s# #8dpK756*%?rN(NpT-# sTs *< 11 68%-?? 1sp*BX1s*18*-<?p#s?6%%H**T N#%?rp-68s#Mr#111-*?<%T*Nspv## #6%6?%%?6-88zp#r8s8*s*%<6Tsp88##82-6#6r%6?s-O86p8rN ?1<*6<%TT-#88#-&#s%6*%s?6-<N8p-r? p16*1<=?#8 8-#?>%s*6s%D<#-#r8p?r% 6*r*z%#?88- ##%S6ss6f*#?8T-8-#br6 61)<s%8?--?8%r%BssI1#*#<-T-N%r6U; }s#68%-??Ns86r6f< #1#*-TpT%N6psrF s86-%???-686#EV6ss1-*?<%-*Nsp ##4ps-68%r?6-s8e#rr8 N1?*-<pTsNU8#>6W-sT6%<%86-JN#p8s< ?1%*6TsTp-#88#-.?s%*6%sTsTrN8p8r?1-16*s<u?#N?8-#?L%s%6s%s<#N88Yp?r% 61s*dT1?88-p-#%L6ss6O*#T1T-N?#*r6 s1z*Y%8?N-?p?s%lssm1#*r<-T?N%#%*< !sr68T<??-%86cs T #1p*-<TT%#*ps!s{rs86p%?T?-68s#)r#ss1-*8<%T*NspK##L8116?%<?6-%8Qp#r8 -18*%<6TsN&8###J-s?*-%6?s-JNrp8r8 ?*%- <sT -#88#-1 s%*%8T?(- N8r6r? %16*s<s?#-p8-#N&%s%6s?m?TT8N8p?r< 66#*,%#-s--88#%d6ss61*#-8T8N?p-r61 1D<*%8N-Np8%#?gss*1#?<<-T-Npp6r< _1s68%-??N%ss#s26 #6p*-<pT%N6#_rW vs86#%??<-6#s#rr# #1-*T<%NXNsper<98s#6?%%?6-*8^9# % -18*%T1TsN#8# 8s s?6-%6?<-z#Tp8r8 r1%*T<sT -#88#- ??666%%?l-rN8prr? %6 *s<s?#Ni8-#T0%6666%!?IT8NNp? s 61s*%%#TI--8?#%g<ss<Z% <8T#N?r*r6sp1^<#? ?--88%#Tis6N1#*#? T?NNp6r< Ks#68<-#%-%8?#s #6 *-<?-?N6p6r. ss86N%?-%-%8s#sr# p1-<6<%T6N?pOrsF8s-6?%T?6ps86p#;b -*<*%TsTs#x#B#87#s?6N%6-p-z8g#1r- p1%*%<sT=-#p8*T4?s-66<1?H-1N8p-i% %1%*s<6?#-p8-r- Ns666%O-NT8N-p? % <1s*s%#?#--p?#% %s<6x%s<8NNN?p%r6 s6<6#%#?--88%#%;s1s6%*8<pT?#1p6rs 96#TT%-?N-%8<#s ! #6#T_<?TNN6# r!E#s86-?9?%-<8s#*r# #1-<?<pT6N%pGrnJ8686??%?p-s8*p#7a -1r*%<--1N_p1#8*?s?6<%6?1-X8s#*r- ?1%-s<sT -##8 G?sN66%%?(8?N8r-r? %1T*s<*?#ps8-#?s5s66<%z?7T8N8p? %% 1s*%%#T --p1#% %%-6v%%<88sN?p%r6 s1r6#<s?-N&8%#%vs1s6T*8? T?p%p6rs as#%s%-T+-%86#svV #18< <?TrN6psr_5#s8%-<#?%-#8s# r#1*1-*??*T6N#px##t8s#6?T%T--s88p# N -6N*%-6TpNmp-#8Hrs?*-%6Nsr<N##?r-1*1%<<<sT% %88r<:?s%66%1?y-gN8p-*? %16*s<??#-88-#?%%s66s%H?<T8N-p?2%%*1s*8%#Tp--p*#%W61p6^%?<8-%N?p<r61s616#<%?--N8%r Is6Q*T*8?6T?80p6G- +16N6%-T6-%8-#sj #6Q*-<?r%N6psru 6s86-%??%D68s#Sr#s11-*?<%T6 sp3##:81s6?%%?6-ssfp#r8 -6 *%<6TsNq18#8 6s?*s%6?1-tp##Nr-ss1%**<s-%-#88r-O?1s66%s?D-6N8!-,- %6m*s?r?#8 8- ? #s66#%5?1T8N#p?s%1Z1s*8%#T6--p #%161T63%-<88-N?prr66s?<6#<??-p%8%f6jsss6**8?<T?NTp6rs y1#N%%-T6-%p*#sYp #18%N<?-xN6p#rVQrs8%-%T?%-#8s# r# #1-*??-T6N#p2##&8sN6?T%?p-s88p# N -%<*%<6-?NDp?#8 %s?6<%6-s- N##%r- ?1%*-<sTONs88r6K?s?66%1?.T#p p-r? %1**s<+?#N18-#?_%s#6s%I<#TrNrp?r% 6-sN p<r# p8N#pK6ss6>-s# Lps86?%1?N11*1%8?--?1%*%%N?#Ns*p<NTNN#p6rs e<mN?pT#N 1< 8sds 6s*-<?T%y611%s<1T-N#%T?%-<8?#er# 8<886#*r< p61r Ys-6?%%ps#1/ps1rr 81?*%<6r r<8r TS-s?6%<%8<-DNrp8&6 ?1%*6?sT#-#8p#- 4s%66%sTsN*N8pNr? T16*s<3-B8s8-#-&%sT6s%b<#T88rp?rT 61s*B%#?8--8N#%v*ss61*#<pT-N#p8r6 s1D*<%8?N-?8<#6!%sT1#*8<-- N%p*rs 61<68%-??Ns86#19E1o<#*-<TT%N#psrDo#*8- %??<-68N#xMs 81#% <%T6Nsr8##Lps-*--??6-18i#?r8 -1??%N6TsN 8#r*C-sr6%<%T6-=Nrp8rN ?1%*6<sT -#8##-g?s%66%s?m-TN8pNr? ?16**<RTs-r8-#?I%1p6s% <#-s <p?rN 66N*L%r?8--8?#-Dpss6:*#T*T-NTp% 61T17*6%8?r-?88#62?<p1#%s<-N N%p*rs 0s#*U<1??-%86rN7^ r18<-8*T%N-psr*i#s#6-%??--68?#_G^ 81N*?<8M Nsp ## #s-6T%%?%-s86#<r8 -1?%?<6T1NJ#7s#n-sT6%%*?s-=N#p8*8 ?1?*6<1T!-#88#-6*s%6*%s?sT#Nrp-r8 r16*s<(N6-88N#?98? 6s%*<#8sN-pTr% 61s*6<<?8--8?{8!6s169<#-1T-N#p%rT s1%6#<s#<-?88#6s?s/1r*8<-T?N-pprs ns#<s%-?T-%#6sr>Ds618*r<?T?N6psr6>#1s6-%-?%-*8s#%%N 81N*?T*T6N1pMrLS8s#* %%?6-sprp#rp -1??*<6T1NK8##8l-s?6%?T?s- N#p8r- ?1%*6- Tf-r88#-M?s%66%s-*T#Npp-rT %16*s<M-1-88-#?f<s66s%F<#T8N-p?!1 61s*H< T8--8?#%68T<-pNr#-vTs 1-6%? Tr8sN8#N -1-#<QTsW1#*88-W6 <6p*<?s- 6r<6??-%861s%8<rTrNrpTr?sB1<%1 1<6-%??%r.1 61*r???-86p<^p <6sr ss-6?%%p<F<s86-% ?81N%F<6TsNY ** <#<N-Np%r?nTs 6 rps61%*6<sp< 16FsN<8T-N%8N#s 11F1rrN 816*s<Qp# ?1T*86r??6*%T<#T8N- N*#<*-6N p D)_r1-#Tj-ss6D*#Nr#5s-1<% <<11*6%8?--?(#6p<%?s-pp6<p- N%p6rs?<TpN#p*rN %s*6*%*s 6e*-<?T% N11*p<1s8*r%??%-6p6 #r# 81-%*<%T6Nsr3r%D8s-6?%%?6-68wr#36 -1?*%<6TsN68#K8 6s?6%%6?s-R8<p8 -s*1%*6<sT/-#8p#- -1s66%1?x--N8p-r?1%1<*s< ?#-p8-#Nq%1%?6%j?0T88<p?r% 6*s*%%#?#--8-#%j-ss*s%s<8T#N?p?r6 s1V6#<r?---8%#?Usss1#<8<rT?N?p6r6 x1s68?-T<-%8%#sSs #61*-?-N9N6p%rW %s86-%??%NN8s#sr#se1-*-<%T68sp0#rz8sN6?%??68sf1p#rp -1T*%<TTspyp<#82Ns?6<%6?p->p##rr- T1%**<sT--#p8r?+?s%66%8?STrN8p-=N %16*s< ?#-88-#?)%s66s<?<#T8N-pN3T 61s*:p6r* 8sp*%<%T N?8<#TC1s86r%6?6TrNNp8r#-N8r#6MsskN*8N#8n1sT66*1<1T16r<s??-%861s%rT -*8## ^*ssp*rNz#s86-N6r*X<s1686#??TNp pNn%N*p-##x8s-T?ps#*^*s*1r*#?%Tp8T<<TpNd8##86p?TN?8Nr r%sp6?%r?*TN*<<#Tv-#886 %T?rN?-?#r err6s% ?sT?**<6?#-88-*r%<?pN%%s ?1**1< ?r-prN?r< Ts--8?#%*6?#-rps8*r#NN#6r6 s1FT p6#N -s<6<<%?*NbTpp#r8 N1?r* %s#68%-8N#81%61%p?11r%-<?T%N6 -%*<N?pN?p<#rX? 66r%pTe?-NT#?O?N6pj##t8s-6?%%<6# 81#sr8 -1?-pp*rNs6p r?i-s?6%-N#< 6rr*>%#?-TrN%#<(6 18rrs&?s%66N<##_-sN1N*8<N-%**<T?#-88-sN%#?*N68 # Y r6-rT r1s*q%#8rqN1-6p<1<sNs8p#T_-s8pTr? s1&6##.#N N1 #< Rs71#*88rf%ss61*1<6T1N#Npa T1?6<%ps 6I*-<?T% N11*p<1sr* %??%-6 s68*rT*Tr8-#TT<N*pU##q8T?-ppp?68p8Pp#r8s8<x*%<6Ts8%8##8m-6?%1%6?s-4N#p8 ?*%%s<sT+-#88#-o8s%%6%8?2TrN8p-r?s?16*??N?#-p8-r }%s*6s% <#-381p?r% 61N*m%r?88-#r#%L*ss6w*#?<T-p?p%r6 11I6r%8TT-?8%r css 1#*#<-T-N%r61r F1_68%N??-p86r66# #6^*-?*T%N6psr! *s868%??--686#_ #s61-*N<%T%Nsp8##s81s6?%-?6-s8Q##r8s86D*%<-TsN-8##8z-s?*s%6?%-o86p8r8 ?6?%*<sT*-#8##-H?s%%6?T?F-1N8prr? N16*s<8?#N 8-#pI%s?6s?(?-T8Nrp?rN 66<*/?#T---8p#%dTss* *#?#-*N?p8r6 #1)6#%8--N<8%#-zss%1#<6<-N?8pp6rT =1168<i??8%pp#s3< #61*-<NT%N61%r; 6s868%???-6pss8r# #1-%6<%T-Ns#s{sM81t6?<-?6-s8wr# D -1#*%<-TsN?8#r# *s?6p%6?N-^N#p8r-s81%*-<sTs-#8p#- -1r66%??(TrN8p-r?1%1**s<<?#N 8-##W%66%T%C?*T88 p?LT 666?T%#T6--p%#%S6ss6z%N<8-1N?p<r6 s1H6#?1?--#8%#p(ss 1#%#?NT?N8p6u% Ys#68?--s-%8-#sO% #66*-?-- N6pTrG <s86-%??%N?8s#%r# #1-*T<%-6 #p7rRl81%6?%T?6-sp*p#r8 -1T*%<6TsNw8##8&-s#6%%6?s-18%p8r- ?<#8Tprr 81N*1%8sT6N%s?QT#d86%*T?rTT86#1T N*8-#?v%%<--8 rirp p68*N?%1**T%#?8-- r6<<F?pT18## rr 8pTr? s1y6#p1#N *sN#<9psZ1#*88%{< T1**#%YT--p#1#p ?8*#TvC #18%8TTT%N*psr*t#s86-???T-681#Srr 818*?T%N Nsp ##Sps-6#%%-6--8gprr8 N1?*T<6Ns868##pF-sT6%%*?sN!8?p8rN ?1-*6<sT=-#p##-I?s%6*%s?3T#N8p-r? %1p*s<:?#-rpi#?j%s6?*-%r:rps<1prTs 1s*q%#8r T16*s%*TsN1818rb#sp18*- *1T6#%8?-#Ns#6*<6? - p^prf-NTpprs qs#81pTr- 1<*s% ? - *p?1T%N6ps18<p?r-Np6p% Ks1*T%1?#1p*r<%T6Nss!*-%p-1-pp?r<-*p^p#r8 -?>8N# r1 #1p**%#<-N*p1r%rV r6#%# N1-*6<sT& *sp*<%psT*1%s?fT#rr6T%6?sT*8s#1r1rr116r<6%NN<8T<#-<N-p?r%s%<G*k%#?8Ns8?#%f66s*8*#<8T-N?p%r- s*G6r%8?--?8%#6=<sV*#% <-T?N%p6rs 1s#%8<???-%86#s/ks*18%8<rT%N*psr6t#s86-???p-681#3rr 818*?T%NNNsp ##/ps-* %%-68T8=prr8 N1?*<<6-s 88##8c-sT6%%*?s-Rp1p8r- ?1<*6<sTZ-#88#-x?sr66%s?G- 81p-r? %?6N#p !< 18*NETs?6s%q<#q1 N6**N <6s*o%#?8rs1p*1%*TI-r8<#^#8s<6*%?%sT 8d#n?pN<8%#6+s<}-<Nr#*rTs#1T1#<rT -pp#r *1s#*HT #18*-#r}*s%1p%1<#?p-p8p?T-p8s#lr#*r-sNT#?r* *66*1<#sp*1%%?6-s>86p*r<N-6-%#&r1sT11*#;ps#6%%6?s#1066#*N?*TN*<<rTL-#88s8%T?T-rps# G s<sp%8?*-%N<<_TT-88-#? ?%s6s%t<#T#N-p?r%166s*g%#?8--8?#<c66s*T*#<8T-N?p%rN s*2*p%8?--?8%#6/?s7*#< <-T?N%p6rs 1s#*#<???-<86#<L} #18<-<-T%N*psr >#1*6-??-p-681#Srr 81#*?T%NNNsp ##=ps-*W%%T6i#8tp#r8ss1?*<<6Ts8*8##8g-sT6%%6?s-VN#p8r-6T1%*6<sT18688#-y?<--Tp-r6r 1n68%<? TT-%#s#r -1p*?%<T%-<8## *Npp#r% 61sT1ppr? T1- TV<sp6Y*#<8pNs66p**?N-1Tpp-p# <1%#<z*sY1#*8#?rpspp<r# }s#68N#r-><1s**<S<r-#Nr#%rTspp6rk&#s86-%?%%}<5s#1c6 81-*?81rpsE1*1<<ws86?%%?6-s8Bp#C6*-1N%?<6TsNF i*N?s<_-<ps#%98s1 p*#?<-?8sprr* 86v#p ss%66%sp6Q1166#1N?*-k8 #s8 -rp #?b%s6-?ps#pRTy8 r1? <1N*2%#?8r<sT6p<s?NN6p1#trrNNpNr6 s1CN#8pr1 -1T#< ?s51#*8N8rT T1r*T?sTp8 p?#8r-1%61%#T -8NN#-rNss1*%TA#sr68%??%-6s s<q s-1-*?<%#<s 6*%&%r?rTN8<rs *Gs6p%?<#1N*p<6TsN/ s* <pT8N?p1rN-18sp8r- ??TNp#8r*N pw#-J?s%T?8<r? sNr#Ar? %16-8NTr8 csr%QbTs86s%H<##*s?6N%-<*-gN1p1?#--8?#%S6ss-(88N8TpN#p%r6 s<sN-pN#p 11T#<Jrsi1#*88pM? <6N%C<*Ts?#p%r<UTsr**O1s?18*-<?#- T6-%6% ?r-Np6#N7?8*#*r# 81--pN-rp r.sr738s-6?%%?6-sr6 #rr #1?*%<6p? r18%djpsr6%%6?s# ss6N%8?%TNNT<*TT-#88#-<rT*N%8pr1># p1p*p T1-*s<2?#r8sN*-%NTsN%%s ?1**1< ?r-p N?r< TM--8?#%6TT}N*8N<pTNNNp8r6 s1UT1Nrp-#-1**8P6sM1#*8<-T?N%p6rs 11T68%-??#psT*%61?%-*8%p8k? T6,rsP#s86-%??%86srs/dG 81-*?<%T6Ns8wsp.r1 6?%%?6r/s 6N% % -pNr<<TpNc8##8*pT8NN8?r*#rs66s%p<p--*%<sTV-#88#-_?<r?6%*?8T#N8p-1r<N-?T1#6ys #116-<NT?-<%1?*T8N-p?68<TT*86ppr#pp8N##H6ss6P-##N=ps 6-*p? T#* <??--?8%s%%N?8--N##TrTs?1?1T?*T<6r<1??-%861%%*T%N,-%pTr? T1#r1 ss86-%?p6f*sr6*r#-?1-*?<%-%r6pW##l81-6?%%?68s#<p#r8 -1?*%?8TsN%rN#8P-s?6N%6?1-JNrp8r#s 1%*6<sT*-#8p#-t8sr66%s?MsTN8pNr?s?<%*s<J?#NT8-#?P%1%??%=<rT8pTp?r% 6*s%S%#?p--8T#% pss%S%s<8TNN?p<r61?1H6#<??--T8%#%Iss=1#*8<rT?N%p6rs 51O68%#?#-%86#s?T #1p*-T?NpN6p<rm ss8<?%??% 68s#%r# 81-*?<%N6N?p_r6481v6?T6?6-s8rp#R -1p*%<-Tspqp<#8vrs?6N%6?#-JN#r6r- #1%**<sTk-#psG<v?sN66<<?gTrN8#er? -1p*s<S?#8 8-#Tm%s?6N%t<#T8s#p?r< 61sNs%#Ts--8-#%^6ss6D%#<8-5N?p8r6 %1a*68T?--#8%r#oss 1#*8<-T8Nrp6rs A6?68%N??--8p#s+^ #<s*-<TT%8% 6rg 6s8%_%??%-6#s Nr#ss1-*#<%T?Ns#sVYa81 6?%r?6-s8jp#/? -1#*%<%TsNs8# 8/Ns?68%6N1-C#sp8S-sr1%*-<s-#-#pi#-1?1*66%??D- N8rpr?6%6T*s<%?#8 8- /G%66%T%&?*T8N#p?xT 666<%%#T6--r*#%)6ss%,*r<8-sN?p#r6 %1x%P?%?-N 8%b8assm1#%#?NT?8kp6 - ks#68<8-6-%8r#ss? #18*-<?--N6p-rU Ts868%??%N%8s#<r#s11-%+<%-6 #p=r6+81p6?%p?6pss%p#Ms -1p*%T*Ts8s#1#8 s?6?%6?s-ap#rBr- r1%*N<sTN-#p#r#7?s#66%??jT#N8#8rN %1p*s?<?#-88-r- Ts668%9-*T8N-p?r%1 1s*<%#T%--8-#% 6?#6X%6<8T8N?ppr6ssT86#<s?-8?8%#?bss=-g*8? T?N?p6rs ;s#N*%-?r-%8?#s_% #18N8<?T8N6p*rOK#s86-<??%--8s#%r#sY1-*#p1T6N?pRsT_8sN6?%%?6-%8Tp#r8 -<1*%<*TsN6p<#8a-s?8r%6?1-up+ #r- #1%%-<sTV-##8 -E?s866%??k-sN8#8x# %1N*sTr?#-88-#? 6s66?%f?mT8N8p?s%s*1s*%%#Np--r #% %s66.%*<8N*N?p%r61s6s6#<1?--r8%#?cs1s6T*8?sT?pNp6rs U6k<?%-T -%#r#s+W #6#TT<?-.N6r<r3.#s8*8%#?%-r8sr8r# 81-*?<NT6NTpxrTE8s86?<%T8-s8%p#Kr -1r*%?%-%NJp*#81<s?6%%6-sN?N##1r- r1%*?<s-sN#88rsI?6N66%s?wN,#?p-: %18*s<C?#N#x##? _s6%<%)<#T8N-#8r% N1s*-%#?#--p?#8M6s?6{??<8- N?#%_N s1%6#?-?--88% 6Y%si66*8<pT?pTp6Fs -s#*s%--?-%8?#s s1N18% <?-8N6psr5s#*16-%r?%-N8s#6r#s#<N*?<#T6#sp9##a8s-6#%%?N-s8sp#r# -6-<1<6T-N7#T#8m-s?%%%-?s-?N##6r- 81%%%?<T+N<88 s(?s%66<6TtT#8%p- p %16*s?sT--8p*#?s#s66s%xT=8?N-#6r%1T1s*D%#?8-p8?##E6s#6K%&<8--8?p%rN s616#<6?-p?pr#6UTsF68*8-sT?p%pNrs ?s#*t%-N6-%p%#?0is?18% <?T%N6psVpZ#166-<s?%-%8srX 86 *??-T6N-p_RO6#s-*;%%?%-s8Ip# 8sN1?*#<6T-NPps#8 8616%%p?s8?N#p8r-s-61*6<8Top%88#-W?1?*-%s?NT##6p-r? %16%8<BT%-8p*#?_?s6*s%-<#-1N-#sr% 81s?F<6?8N 8?#<+66<6=<>N#T-8Sp% % s1j6#?8-1-?8##63-s_*N*8T--#N%p8rs ?s#*p%-T?N886#TBv1N18%s<?8%N8psr<!#6%6-?N?%N6p8#7c* 8*-*?<8T6Nsp1## 6s-6N%%?6-s8jrsr8ss1?*-<6T?N!psr*.-s?6%#p?s- N#p8*8 ?18*6<6Tb-#88#- ?s%6-%s?%T#8ep-r#<116*?<_M8-88N#?f%s66%%T<#T8N-*%r% *1s*Rp.?8Nb8?#?z6ss6/*#T-T-N#p%r- s166#?8T?-?88#6L?sm*a*8<-NsN%p-rs ss#6p%-??8186#?z.s}18*-<?N%N#psr%t#1)6-<<?%-6s6#/M6 81p*?<%T6Ns#>## ss-6#%%??-s8%LNr8s:1?pT<6T1N_8r#8:#1 6%%6?ss1N#ppr- 81r*6<sTW1<88#N;?s%-%%s?%T#Nrp-r? %16<a<{T6-8pZ#?w-s6%s<f<#-sN-p#r%s%1s*l<r?8NL8?#?t6s165*#?NT-N#p%r< s1A6#?8T%-?88#6:%sY6p*8?t)*N%p6rs 8s#6p%-?--%8?#NIG #18%%<?T<N6ps+*X#s86-%T?%-68s#Fr# 81-"); local n = 0; h.IRmaxCGQ(function() h.wIaJKmsf() n = n + 1 end) local
  83. function e(e, s) if s then
  84. return n end; n = e + n; end local s, n, o = f(0, f, e, a, h.pybvPsQi); local
  85. function l() local s, n = h.pybvPsQi(a, e(1, 3), e(5, 6) + 2); e(2);
  86. return (n * 256) + s; end; local u = true; local u = 0 local
  87. function _() local r = n(); local e = n(); local d = 1; local r = (s(e, 1, 20) * (2 ^ 32)) + r; local n = s(e, 21, 31); local e = ((-1) ^ s(e, 32));
  88. if (n == 0) then
  89. if (r == u) then
  90. return e * 0;
  91. else n = 1; d = 0; end; elseif(n == 2047) then
  92. return (r == 0) and(e * (1 / 0)) or(e * (0 / 0)); end;
  93. return h.jwBVJFwo(e, n - 1023) * (d + (r / (2 ^ 52))); end; local k = n; local
  94. function g(n) local s;
  95. if (not n) then n = k();
  96. if (n == 0) then
  97. return ''; end; end; s = h.LQcXmU_f(a, e(1, 3), e(5, 6) + n - 1); e(n) local e = ""
  98. for n = (1 + u), #s do e = e..h.LQcXmU_f(s, n, n) end
  99. return e;
  100. end; local k = #h.BWhGhSly(c('\49.\48')) ~ = 1 local e = n; local
  101. function re(...) return {
  102. ...
  103. }, h.SFOPOqkJ('#', ...) end local
  104. function ne() local c = {}; local e = {}; local a = {}; local u = {
  105. a,
  106. c,
  107. nil,
  108. e
  109. }; local e = n() local f = {}
  110. for r = 1, e do local s = o();
  111. local e;
  112. if (s == 1) then e = (o() ~ = #{}); elseif(s == 2) then local n = _();
  113. if k and h.GcophrRR(h.BWhGhSly(n), '.(\48+)$') then n = h.XopnYGtM(n); end e = n; elseif(s == 3) then e = g(); end; f[r] = e; end; u[3] = o();
  114. for h = 1, n() do local e = o();
  115. if (s(e, 1, 1) == 0) then local p = s(e, 2, 3); local o = s(e, 4, 6); local e = {
  116. l(),
  117. l(),
  118. nil,
  119. nil
  120. };
  121. if (p == 0) then e[d] = l(); e[t] = l(); elseif(p == #{
  122. 1
  123. }) then e[d] = n(); elseif(p == b[2]) then e[d] = n() - (2 ^ 16) elseif(p == b[3]) then e[d] = n() - (2 ^ 16) e[t] = l(); end;
  124. if (s(o, 1, 1) == 1) then e[r] = f[e[r]] end
  125. if (s(o, 2, 2) == 1) then e[d] = f[e[d]] end
  126. if (s(o, 3, 3) == 1) then e[t] = f[e[t]] end a[h] = e; end end;
  127. for e = 1, n() do c[e - (#{
  128. 1
  129. })] = ne();
  130. end;
  131. return u; end; local
  132. function se(s, n, e) local r = n; local r = e;
  133. return c(h.GcophrRR(h.GcophrRR(({
  134. h.IRmaxCGQ(s)
  135. })[2], n), e)) end local
  136. function k(j, c, o) local
  137. function ne(...) local l, _, y, ne, b, n, a, ee, z, g, u, s; local e = 0;
  138. while -1 < e do
  139. if e <
  140. 3 then
  141. if 0 < e then
  142. if e~ = 2 then y = f(6, 4, 3, 19, j); b = re ne = 0;
  143. else n = -41; a = -1; end
  144. else l = f(6, 25, 1, 67, j); _ = f(6, 37, 2, 20, j); end
  145. else if 4 < e then
  146. if e == 6 then e = -2;
  147. else s = f(7); end
  148. else if 0 < e then
  149. for n = 17, 89 do
  150. if e~ =
  151. 4 then ee = {}; z = {
  152. ...
  153. };
  154. break; end; g = h.SFOPOqkJ('#', ...) - 1; u = {};
  155. break; end;
  156. else g = h.SFOPOqkJ('#', ...) - 1; u = {}; end end end e = e + 1; end;
  157. for e = 0, g do
  158. if (e >= y) then ee[e - y] = z[e + 1];
  159. else s[e] = z[e + 1];
  160. end; end; local e = g - y + 1 local e; local f; local
  161. function g(...) while true do end end
  162. while
  163. true do
  164. if n < -
  165. 40 then n = n + 42 end e = l[n]; f = e[m];
  166. if 55 < f then
  167. if f >= 84 then
  168. if f >= 98 then
  169. if f >= 105 then
  170. if 108 >= f then
  171. if f > 106 then
  172. if f >= 104 then repeat
  173. if f < 108 then local n = e[r] local r, e = b(s[n](p(s, n + 1, e[d]))) a = e + n - 1 local e = 0;
  174. for n = n, a do e = e + 1;
  175. s[n] = r[e]; end;
  176. break; end; s[e[r]][e[d]] = s[e[t]]; until true;
  177. else s[e[r]][e[d]] = s[e[t]]; end
  178. else if 106 == f then local f, h;
  179. for o = 0, 6 do
  180. if o <=
  181. 2 then
  182. if 1 <= o then
  183. if o~ = -2 then repeat
  184. if o~ = 2 then f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  185. break; end; f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n]; until true;
  186. else f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  187. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end
  188. else if o < 5 then
  189. if -1~ = o then
  190. for f = 28, 75 do
  191. if o~ =
  192. 4 then s[e[r]] = {}; n = n + 1; e = l[n];
  193. break; end; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  194. break; end;
  195. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  196. else if o >= 1 then
  197. for a = 12, 58 do
  198. if o <
  199. 6 then f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  200. break; end; f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]];
  201. break; end;
  202. else f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end end end end
  203. else s[e[r]][s[e[d]]] = s[e[t]]; end end
  204. else if f < 111 then
  205. if 108 <= f then repeat
  206. if 110 > f then local r = e[r]; local t = e[t]; local l = r + 2 local r = {
  207. s[r](s[r + 1], s[l])
  208. };
  209. for e = 1, t do s[l + e] = r[e];
  210. end; local r = r[1]
  211. if r then s[l] = r n = e[d];
  212. else n = n + 1; end;
  213. break; end; local o, h;
  214. for f = 0, 6 do
  215. if f <=
  216. 2 then
  217. if 1 <= f then
  218. if f >= 0 then
  219. for p = 48, 52 do
  220. if 1~ =
  221. f then s[e[r]] = {}; n = n + 1; e = l[n];
  222. break; end; o = e[r]; h = s[e[d]]; s[o + 1] = h; s[o] = h[e[t]]; n = n + 1; e = l[n];
  223. break; end;
  224. else s[e[r]] = {}; n = n + 1; e = l[n]; end
  225. else o = e[r] s[o](p(s, o + 1, e[d])) n = n + 1; e = l[n]; end
  226. else if 4 >= f then
  227. if f~ = 1 then repeat
  228. if 3 < f then s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  229. break; end; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; until true;
  230. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  231. else if 3 < f then
  232. for p = 17, 69 do
  233. if f~ =
  234. 6 then s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  235. break; end; s[e[r]][e[d]] = e[t];
  236. break; end;
  237. else s[e[r]][e[d]] = e[t]; end end end end until true;
  238. else local o, h;
  239. for f = 0, 6 do
  240. if f <=
  241. 2 then
  242. if 1 <= f then
  243. if f >= 0 then
  244. for p = 48, 52 do
  245. if 1~ =
  246. f then s[e[r]] = {}; n = n + 1; e = l[n];
  247. break; end; o = e[r]; h = s[e[d]]; s[o + 1] = h; s[o] = h[e[t]]; n = n + 1; e = l[n];
  248. break; end;
  249. else s[e[r]] = {}; n = n + 1; e = l[n]; end
  250. else o = e[r] s[o](p(s, o + 1, e[d])) n = n + 1; e = l[n]; end
  251. else if 4 >= f then
  252. if f~ = 1 then repeat
  253. if 3 < f then s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  254. break; end; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; until true;
  255. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  256. else if 3 < f then
  257. for p = 17, 69 do
  258. if f~ =
  259. 6 then s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  260. break; end; s[e[r]][e[d]] = e[t];
  261. break; end;
  262. else s[e[r]][e[d]] = e[t]; end end end end end
  263. else if f == 111 then local f, a;
  264. for h = 0, 6 do
  265. if h >=
  266. 3 then
  267. if h >= 5 then
  268. if 2 < h then repeat
  269. if h~ = 6 then f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  270. break; end; s[e[r]] = o[e[d]]; until true;
  271. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  272. else if h~ = 3 then s(e[r], e[d]); n = n + 1; e = l[n];
  273. else f = e[r]; a = s[e[d]]; s[f + 1] = a; s[f] = a[e[t]]; n = n + 1; e = l[n]; end end
  274. else if h > 0 then
  275. if 1 == h then f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  276. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end
  277. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end end end
  278. else
  279. for f = 0, 5 do
  280. if 3 > f then
  281. if f <= 0 then s[e[r]] = c[e[d]]; n = n + 1; e = l[n];
  282. else if f == 1 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  283. else s[e[r]] = s[e[d]] - s[e[t]]; n = n + 1; e = l[n]; end end
  284. else if 3 < f then
  285. if 4~ = f then
  286. if (s[e[r]] <= s[e[t]]) then n = e[d];
  287. else n = n + 1; end;
  288. else s[e[r]] = c[e[d]]; n = n + 1; e = l[n]; end
  289. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end end end end end
  290. else if 100 < f then
  291. if f > 102 then
  292. if 99 <= f then repeat
  293. if 103~ = f then local a = _[e[d]]; local p; local f = {}; p = h.gYVadrOt({}, {
  294. __index = function(n, e) local e = f[e];
  295. return e[1][e[2]];end,
  296. __newindex = function(s, e, n) local e = f[e] e[1][e[2]] = n;end;
  297. });
  298. for r = 1, e[t] do n = n + 1;
  299. local e = l[n];
  300. if e[m] == 96 then f[r - 1] = {
  301. s,
  302. e[d]
  303. };
  304. else f[r - 1] = {
  305. c,
  306. e[d]
  307. }; end; u[#u + 1] = f; end; s[e[r]] = k(a, p, o);
  308. break; end; local f, h;
  309. for o = 0, 5 do
  310. if 2 >=
  311. o then
  312. if 1 <= o then
  313. if o == 2 then f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  314. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  315. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  316. else if 4 <= o then
  317. if 3~ = o then repeat
  318. if o~ = 5 then s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  319. break; end; s[e[r]][e[d]] = e[t]; until true;
  320. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  321. else s[e[r]] = {}; n = n + 1; e = l[n]; end end end until true;
  322. else local a = _[e[d]]; local p; local f = {}; p = h.gYVadrOt({}, {
  323. __index = function(n, e) local e = f[e];
  324. return e[1][e[2]];end,
  325. __newindex = function(s, e, n) local e = f[e] e[1][e[2]] = n;end;
  326. });
  327. for r = 1, e[t] do n = n + 1;
  328. local e = l[n];
  329. if e[m] == 96 then f[r - 1] = {
  330. s,
  331. e[d]
  332. };
  333. else f[r - 1] = {
  334. c,
  335. e[d]
  336. }; end; u[#u + 1] = f; end; s[e[r]] = k(a, p, o); end
  337. else if 97 < f then
  338. for h = 13, 89 do
  339. if 101 <
  340. f then local f; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) break; end; local f, c, _, k, u;
  341. for h = 0, 6 do
  342. if 2 <
  343. h then
  344. if h >= 5 then
  345. if 2 < h then
  346. for d = 30, 58 do
  347. if 6~ =
  348. h then f = e[r] s[f] = s[f](p(s, f + 1, a)) n = n + 1; e = l[n];
  349. break; end; f = e[r] s[f] = s[f]() break; end;
  350. else f = e[r] s[f] = s[f]() end
  351. else if 3 == h then s[e[r]] = (e[d] ~ = 0); n = n + 1; e = l[n];
  352. else f = e[r] _, k = b(s[f](p(s, f + 1, e[d]))) a = k + f - 1 u = 0;
  353. for e = f, a do u = u + 1;
  354. s[e] = _[u]; end; n = n + 1; e = l[n]; end end
  355. else if 0 < h then
  356. if h >= -3 then
  357. for p = 11, 97 do
  358. if h~ =
  359. 1 then s(e[r], e[d]); n = n + 1; e = l[n];
  360. break; end; f = e[r]; c = s[e[d]]; s[f + 1] = c; s[f] = c[e[t]]; n = n + 1; e = l[n];
  361. break; end;
  362. else f = e[r]; c = s[e[d]]; s[f + 1] = c; s[f] = c[e[t]]; n = n + 1; e = l[n]; end
  363. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end end end
  364. break; end;
  365. else local f; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) end end
  366. else if f <= 98 then s[e[r]] = c[e[d]];
  367. else if 97 < f then
  368. for n = 44, 53 do
  369. if 100~ =
  370. f then s[e[r]] = {};
  371. break; end; local e = e[r] s[e] = s[e](s[e + 1]) break; end;
  372. else s[e[r]] = {}; end end end end
  373. else if 90 < f then
  374. if f > 93 then
  375. if 95 < f then
  376. if 94 <= f then
  377. for n = 25, 53 do
  378. if 96 <
  379. f then local e = e[r] s[e] = s[e](p(s, e + 1, a)) break; end; local f, p, h, o, t, l; local n = 0;
  380. while n > -1 do
  381. if n <
  382. 4 then
  383. if n > 1 then
  384. if n >= 1 then repeat
  385. if 3 > n then h = d;
  386. break; end; o = s; until true;
  387. else o = s; end
  388. else if n > -1 then repeat
  389. if n > 0 then p = r;
  390. break; end; f = e; until true;
  391. else p = r; end end
  392. else if 6 <= n then
  393. if n > 5 then
  394. for e = 42, 90 do
  395. if n >
  396. 6 then n = -2;
  397. break; end; s[l] = t;
  398. break; end;
  399. else s[l] = t; end
  400. else if n == 4 then t = o[f[h]];
  401. else l = f[p]; end end end n = n + 1 end
  402. break; end;
  403. else local f, l, h, t, p, o; local n = 0;
  404. while n > -1 do
  405. if n <
  406. 4 then
  407. if n > 1 then
  408. if n >= 1 then repeat
  409. if 3 > n then h = d;
  410. break; end; t = s; until true;
  411. else t = s; end
  412. else if n > -1 then repeat
  413. if n > 0 then l = r;
  414. break; end; f = e; until true;
  415. else l = r; end end
  416. else if 6 <= n then
  417. if n > 5 then
  418. for e = 42, 90 do
  419. if n >
  420. 6 then n = -2;
  421. break; end; s[o] = p;
  422. break; end;
  423. else s[o] = p; end
  424. else if n == 4 then p = t[f[h]];
  425. else o = f[l]; end end end n = n + 1 end end
  426. else if 94~ = f then local f, o; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n]; s[e[r]] = {}; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t];
  427. else local f, o; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n]; s[e[r]] = {}; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; end end
  428. else if f <= 91 then
  429. for f = 0, 6 do
  430. if 3 <=
  431. f then
  432. if f > 4 then
  433. if f~ = 4 then
  434. for p = 34, 54 do
  435. if 6~ =
  436. f then s[e[r]] = o[e[d]]; n = n + 1; e = l[n];
  437. break; end; s[e[r]] = s[e[d]][e[t]];
  438. break; end;
  439. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end
  440. else if f < 4 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  441. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end
  442. else if 1 > f then s[e[r]] = o[e[d]]; n = n + 1; e = l[n];
  443. else if -3 <= f then
  444. for p = 41, 91 do
  445. if 2 >
  446. f then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  447. break; end; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  448. break; end;
  449. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end end end
  450. else if f >= 90 then repeat
  451. if 93~ = f then s[e[r]][e[d]] = e[t];
  452. break; end;
  453. if s[e[r]] then n = n + 1;
  454. else n = e[d]; end; until true;
  455. else s[e[r]][e[d]] = e[t]; end end end
  456. else if f >= 87 then
  457. if 88 >= f then
  458. if 83~ = f then
  459. for n = 36, 65 do
  460. if f~ =
  461. 87 then local e = e[r] local r, n = b(s[e](s[e + 1])) a = n + e - 1 local n = 0;
  462. for e = e, a do n = n + 1;
  463. s[e] = r[n]; end;
  464. break; end; s[e[r]][e[d]] = e[t];
  465. break; end;
  466. else s[e[r]][e[d]] = e[t]; end
  467. else if f == 90 then local e = e[r] s[e](s[e + 1])
  468. else local f, o;
  469. for p = 0, 4 do
  470. if 2 >
  471. p then
  472. if p >= -2 then repeat
  473. if p~ = 0 then f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n];
  474. break; end; s[e[r]] = s[e[d]][s[e[t]]]; n = n + 1; e = l[n]; until true;
  475. else s[e[r]] = s[e[d]][s[e[t]]]; n = n + 1; e = l[n]; end
  476. else if p > 2 then
  477. if p < 4 then s[e[r]] = c[e[d]]; n = n + 1; e = l[n];
  478. else s[e[r]][s[e[d]]] = e[t]; end
  479. else f = e[r] s[f](s[f + 1]) n = n + 1; e = l[n]; end end end end end
  480. else if 85 > f then
  481. if (s[e[r]] <= s[e[t]]) then n = e[d];
  482. else n = n + 1; end;
  483. else if 83 <= f then
  484. for o = 11, 55 do
  485. if f~ =
  486. 85 then local f, h;
  487. for o = 0, 6 do
  488. if o >
  489. 2 then
  490. if 5 > o then
  491. if o~ = -1 then
  492. for p = 10, 57 do
  493. if o >
  494. 3 then s(e[r], e[d]); n = n + 1; e = l[n];
  495. break; end; f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  496. break; end;
  497. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  498. else if o == 6 then
  499. if not s[e[r]] then n = n + 1;
  500. else n = e[d]; end;
  501. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end end
  502. else if 1 > o then f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  503. else if 2~ = o then s(e[r], e[d]); n = n + 1; e = l[n];
  504. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end end end end
  505. break; end; s[e[r]] = c[e[d]];
  506. break; end;
  507. else s[e[r]] = c[e[d]]; end end end end end
  508. else if f >= 70 then
  509. if f >= 77 then
  510. if f > 79 then
  511. if f <= 81 then
  512. if 81 == f then local f, h;
  513. for o = 0, 3 do
  514. if o >=
  515. 2 then
  516. if -2~ = o then repeat
  517. if 3 > o then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  518. break; end; f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; until true;
  519. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end
  520. else if -2 < o then
  521. for h = 17, 88 do
  522. if o <
  523. 1 then s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  524. break; end; f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  525. break; end;
  526. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end end end
  527. else if not s[e[r]] then n = n + 1;
  528. else n = e[d]; end; end
  529. else if f~ = 79 then
  530. for l = 22, 57 do
  531. if f >
  532. 82 then local n = e[r] s[n](p(s, n + 1, e[d])) break; end;
  533. if s[e[r]] then n = n + 1;
  534. else n = e[d]; end;
  535. break; end;
  536. else if s[e[r]] then n = n + 1;
  537. else n = e[d]; end; end end
  538. else if 78 <= f then
  539. if 76 < f then repeat
  540. if f~ = 79 then local f, a;
  541. for h = 0, 6 do
  542. if h <=
  543. 2 then
  544. if h >= 1 then
  545. if h > 1 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  546. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  547. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  548. else if 4 >= h then
  549. if -1~ = h then
  550. for p = 43, 80 do
  551. if h >
  552. 3 then s(e[r], e[d]); n = n + 1; e = l[n];
  553. break; end; f = e[r]; a = s[e[d]]; s[f + 1] = a; s[f] = a[e[t]]; n = n + 1; e = l[n];
  554. break; end;
  555. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  556. else if h == 6 then s[e[r]] = o[e[d]];
  557. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end end end end
  558. break; end; local r = e[r]; local t = e[t]; local l = r + 2 local r = {
  559. s[r](s[r + 1], s[l])
  560. };
  561. for e = 1, t do s[l + e] = r[e];
  562. end; local r = r[1]
  563. if r then s[l] = r n = e[d];
  564. else n = n + 1; end; until true;
  565. else local f, a;
  566. for h = 0, 6 do
  567. if h <=
  568. 2 then
  569. if h >= 1 then
  570. if h > 1 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  571. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  572. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  573. else if 4 >= h then
  574. if -1~ = h then
  575. for p = 43, 80 do
  576. if h >
  577. 3 then s(e[r], e[d]); n = n + 1; e = l[n];
  578. break; end; f = e[r]; a = s[e[d]]; s[f + 1] = a; s[f] = a[e[t]]; n = n + 1; e = l[n];
  579. break; end;
  580. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  581. else if h == 6 then s[e[r]] = o[e[d]];
  582. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end end end end end
  583. else local r = e[r]; local n = s[e[d]]; s[r + 1] = n; s[r] = n[e[t]]; end end
  584. else if 73 > f then
  585. if 70 >= f then local f, k, c, _, h, u;
  586. for c = 0, 5 do
  587. if c >=
  588. 3 then
  589. if 3 < c then
  590. if c~ = 0 then
  591. for o = 35, 69 do
  592. if 5 >
  593. c then f = e[r] u = {
  594. s[f](p(s, f + 1, a))
  595. }; h = 0;
  596. for e = f, e[t] do h = h + 1;
  597. s[e] = u[h]; end n = n + 1; e = l[n];
  598. break; end; n = e[d];
  599. break; end;
  600. else n = e[d]; end
  601. else f = e[r] u, _ = b(s[f](s[f + 1])) a = _ + f - 1 h = 0;
  602. for e = f, a do h = h + 1;
  603. s[e] = u[h]; end; n = n + 1; e = l[n]; end
  604. else if c >= 1 then
  605. if 1 == c then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  606. else f = e[r]; k = s[e[d]]; s[f + 1] = k; s[f] = k[e[t]]; n = n + 1; e = l[n]; end
  607. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end end end
  608. else if f~ = 72 then c[e[d]] = s[e[r]];
  609. else local f, o; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s[e[r]] = {}; n = n + 1; e = l[n]; s[e[r]] = {}; n = n + 1; e = l[n]; f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n]; s[e[r]] = {}; end end
  610. else if 74 >= f then
  611. if f > 69 then
  612. for b = 20, 98 do
  613. if 73~ =
  614. f then local a = _[e[d]]; local p; local f = {}; p = h.gYVadrOt({}, {
  615. __index = function(n, e) local e = f[e];
  616. return e[1][e[2]];end,
  617. __newindex = function(s, e, n) local e = f[e] e[1][e[2]] = n;end;
  618. });
  619. for r = 1, e[t] do n = n + 1;
  620. local e = l[n];
  621. if e[m] == 96 then f[r - 1] = {
  622. s,
  623. e[d]
  624. };
  625. else f[r - 1] = {
  626. c,
  627. e[d]
  628. }; end; u[#u + 1] = f; end; s[e[r]] = k(a, p, o);
  629. break; end; local e = e[r] s[e] = s[e](p(s, e + 1, a)) break; end;
  630. else local e = e[r] s[e] = s[e](p(s, e + 1, a)) end
  631. else if f~ = 74 then repeat
  632. if f < 76 then s[e[r]] = (e[d] ~ = 0);
  633. break; end; local p, c, h, u, b, f, a; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; f = 0;
  634. while f > -1 do
  635. if 2 <
  636. f then
  637. if 4 >= f then
  638. if f == 4 then b = p[c];
  639. else u = p[h]; end
  640. else if f > 5 then f = -2;
  641. else s(b, u); end end
  642. else if 0 >= f then p = e;
  643. else if f > -2 then
  644. for e = 33, 63 do
  645. if 2 >
  646. f then c = r;
  647. break; end; h = d;
  648. break; end;
  649. else h = d; end end end f = f + 1 end n = n + 1; e = l[n]; a = e[r] s[a](s[a + 1]) n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; until true;
  650. else s[e[r]] = (e[d] ~ = 0); end end end end
  651. else if 62 >= f then
  652. if f <= 58 then
  653. if f > 56 then
  654. if 55 < f then
  655. for h = 48, 68 do
  656. if 57~ =
  657. f then local e = e[r] local r, n = b(s[e](s[e + 1])) a = n + e - 1 local n = 0;
  658. for e = e, a do n = n + 1;
  659. s[e] = r[n]; end;
  660. break; end; local h;
  661. for f = 0, 6 do
  662. if 3 <=
  663. f then
  664. if f <= 4 then
  665. if 3 < f then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  666. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end
  667. else if 5 == f then s(e[r], e[d]); n = n + 1; e = l[n];
  668. else h = e[r] s[h](s[h + 1]) end end
  669. else if f < 1 then s(e[r], e[d]); n = n + 1; e = l[n];
  670. else if f > -1 then
  671. for t = 36, 97 do
  672. if 1~ =
  673. f then h = e[r] s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n];
  674. break; end; s[e[r]] = (e[d] ~ = 0); n = n + 1; e = l[n];
  675. break; end;
  676. else s[e[r]] = (e[d] ~ = 0); n = n + 1; e = l[n]; end end end end
  677. break; end;
  678. else local h;
  679. for f = 0, 6 do
  680. if 3 <=
  681. f then
  682. if f <= 4 then
  683. if 3 < f then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  684. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end
  685. else if 5 == f then s(e[r], e[d]); n = n + 1; e = l[n];
  686. else h = e[r] s[h](s[h + 1]) end end
  687. else if f < 1 then s(e[r], e[d]); n = n + 1; e = l[n];
  688. else if f > -1 then
  689. for t = 36, 97 do
  690. if 1~ =
  691. f then h = e[r] s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n];
  692. break; end; s[e[r]] = (e[d] ~ = 0); n = n + 1; e = l[n];
  693. break; end;
  694. else s[e[r]] = (e[d] ~ = 0); n = n + 1; e = l[n]; end end end end end
  695. else
  696. for f = 0, 4 do
  697. if f < 2 then
  698. if 1 == f then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  699. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end
  700. else if f > 2 then
  701. if -1~ = f then repeat
  702. if 4~ = f then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  703. break; end;
  704. if not s[e[r]] then n = n + 1;
  705. else n = e[d]; end; until true;
  706. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end
  707. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end end end
  708. else if 61 > f then
  709. if f > 59 then s[e[r]] = k(_[e[d]], nil, o);
  710. else local p, h, u, c, a, f, o; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; f = 0;
  711. while f > -1 do
  712. if 2 >=
  713. f then
  714. if f <= 0 then p = e;
  715. else if 1~ = f then u = d;
  716. else h = r; end end
  717. else if f >= 5 then
  718. if 6 > f then s(a, c);
  719. else f = -2; end
  720. else if -1~ = f then repeat
  721. if 4~ = f then c = p[u];
  722. break; end; a = p[h]; until true;
  723. else a = p[h]; end end end f = f + 1 end n = n + 1; e = l[n]; o = e[r] s[o] = s[o](s[o + 1]) n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; end
  724. else if 61 == f then local r = e[r] local d = {
  725. s[r](s[r + 1])
  726. }; local n = 0;
  727. for e = r, e[t] do n = n + 1;
  728. s[e] = d[n]; end
  729. else
  730. for f = 0, 6 do
  731. if f >= 3 then
  732. if 5 <= f then
  733. if f >= 1 then repeat
  734. if 5 < f then s[e[r]] = s[e[d]][e[t]];
  735. break; end; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; until true;
  736. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end
  737. else if 4~ = f then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  738. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end
  739. else if f >= 1 then
  740. if f~ = 2 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  741. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end
  742. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end end end end end end
  743. else if 65 < f then
  744. if 67 < f then
  745. if 65~ = f then repeat
  746. if 68~ = f then local h;
  747. for f = 0, 6 do
  748. if f >
  749. 2 then
  750. if 5 > f then
  751. if f < 4 then s(e[r], e[d]); n = n + 1; e = l[n];
  752. else s[e[r]] = s[e[d]]; n = n + 1; e = l[n]; end
  753. else if 3 < f then
  754. for t = 21, 59 do
  755. if f <
  756. 6 then h = e[r] s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n];
  757. break; end;
  758. if not s[e[r]] then n = n + 1;
  759. else n = e[d]; end;
  760. break; end;
  761. else h = e[r] s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n]; end end
  762. else if 0 >= f then s[e[r]] = o[e[d]]; n = n + 1; e = l[n];
  763. else if f~ = -2 then
  764. for p = 13, 94 do
  765. if f~ =
  766. 1 then s[e[r]] = o[e[d]]; n = n + 1; e = l[n];
  767. break; end; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  768. break; end;
  769. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end end end end
  770. break; end; local h;
  771. for f = 0, 6 do
  772. if 3 >
  773. f then
  774. if 0 < f then
  775. if -1~ = f then repeat
  776. if 2~ = f then h = e[r] s[h] = s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n];
  777. break; end; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; until true;
  778. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end
  779. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  780. else if f >= 5 then
  781. if 4~ = f then repeat
  782. if 6~ = f then s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  783. break; end; s[e[r]] = o[e[d]]; until true;
  784. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end
  785. else if -1 <= f then
  786. for p = 16, 70 do
  787. if f <
  788. 4 then s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  789. break; end; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  790. break; end;
  791. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end end end end until true;
  792. else local h;
  793. for f = 0, 6 do
  794. if 3 >
  795. f then
  796. if 0 < f then
  797. if -1~ = f then repeat
  798. if 2~ = f then h = e[r] s[h] = s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n];
  799. break; end; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; until true;
  800. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end
  801. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  802. else if f >= 5 then
  803. if 4~ = f then repeat
  804. if 6~ = f then s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  805. break; end; s[e[r]] = o[e[d]]; until true;
  806. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end
  807. else if -1 <= f then
  808. for p = 16, 70 do
  809. if f <
  810. 4 then s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  811. break; end; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  812. break; end;
  813. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end end end end end
  814. else if f > 65 then repeat
  815. if 66~ = f then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; do return end;
  816. break; end; s[e[r]] = o[e[d]]; until true;
  817. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; do return end;
  818. end end
  819. else if f <= 63 then local h;
  820. for f = 0, 6 do
  821. if f >=
  822. 3 then
  823. if f < 5 then
  824. if 4 > f then s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  825. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; end
  826. else if 3 <= f then
  827. for p = 40, 72 do
  828. if f~ =
  829. 5 then s(e[r], e[d]);
  830. break; end; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  831. break; end;
  832. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end
  833. else if 1 <= f then
  834. if -3~ = f then
  835. for t = 17, 86 do
  836. if f~ =
  837. 2 then s(e[r], e[d]); n = n + 1; e = l[n];
  838. break; end; h = e[r] s[h] = s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n];
  839. break; end;
  840. else h = e[r] s[h] = s[h](p(s, h + 1, e[d])) n = n + 1; e = l[n]; end
  841. else s(e[r], e[d]); n = n + 1; e = l[n]; end end end
  842. else if f > 60 then repeat
  843. if f~ = 64 then local p, u, a, h, c, f, b; f = 0;
  844. while f > -1 do
  845. if f <=
  846. 2 then
  847. if f >= 1 then
  848. if f == 2 then a = d;
  849. else u = r; end
  850. else p = e; end
  851. else if 4 >= f then
  852. if 2 < f then repeat
  853. if f~ = 4 then h = p[a];
  854. break; end; c = p[u]; until true;
  855. else h = p[a]; end
  856. else if 5~ = f then f = -2;
  857. else s(c, h); end end end f = f + 1 end n = n + 1; e = l[n]; b = e[r] s[b] = s[b](s[b + 1]) n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = 0;
  858. while f > -1 do
  859. if f <
  860. 3 then
  861. if f <= 0 then p = e;
  862. else if -3 < f then repeat
  863. if 2 > f then u = r;
  864. break; end; a = d; until true;
  865. else a = d; end end
  866. else if f <= 4 then
  867. if 2 < f then repeat
  868. if f < 4 then h = p[a];
  869. break; end; c = p[u]; until true;
  870. else c = p[u]; end
  871. else if f~ = 2 then
  872. for e = 27, 62 do
  873. if f <
  874. 6 then s(c, h);
  875. break; end; f = -2;
  876. break; end;
  877. else s(c, h); end end end f = f + 1 end n = n + 1; e = l[n]; s(e[r], e[d]);
  878. break; end; local f, a, p;
  879. for h = 0, 4 do
  880. if h <=
  881. 1 then
  882. if -3 <= h then
  883. for f = 46, 61 do
  884. if h <
  885. 1 then s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  886. break; end; s[e[r]] = o[e[d]]; n = n + 1; e = l[n];
  887. break; end;
  888. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  889. else if h >= 3 then
  890. if h > 0 then repeat
  891. if 3 < h then n = e[d];
  892. break; end; f = e[r] a = {
  893. s[f](s[f + 1])
  894. }; p = 0;
  895. for e = f, e[t] do p = p + 1;
  896. s[e] = a[p]; end n = n + 1; e = l[n]; until true;
  897. else f = e[r] a = {
  898. s[f](s[f + 1])
  899. }; p = 0;
  900. for e = f, e[t] do p = p + 1;
  901. s[e] = a[p]; end n = n + 1; e = l[n]; end
  902. else s[e[r]] = c[e[d]]; n = n + 1; e = l[n]; end end end until true;
  903. else local p, u, h, a, c, f, b; f = 0;
  904. while f > -1 do
  905. if f <=
  906. 2 then
  907. if f >= 1 then
  908. if f == 2 then h = d;
  909. else u = r; end
  910. else p = e; end
  911. else if 4 >= f then
  912. if 2 < f then repeat
  913. if f~ = 4 then a = p[h];
  914. break; end; c = p[u]; until true;
  915. else a = p[h]; end
  916. else if 5~ = f then f = -2;
  917. else s(c, a); end end end f = f + 1 end n = n + 1; e = l[n]; b = e[r] s[b] = s[b](s[b + 1]) n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = 0;
  918. while f > -1 do
  919. if f <
  920. 3 then
  921. if f <= 0 then p = e;
  922. else if -3 < f then repeat
  923. if 2 > f then u = r;
  924. break; end; h = d; until true;
  925. else h = d; end end
  926. else if f <= 4 then
  927. if 2 < f then repeat
  928. if f < 4 then a = p[h];
  929. break; end; c = p[u]; until true;
  930. else c = p[u]; end
  931. else if f~ = 2 then
  932. for e = 27, 62 do
  933. if f <
  934. 6 then s(c, a);
  935. break; end; f = -2;
  936. break; end;
  937. else s(c, a); end end end f = f + 1 end n = n + 1; e = l[n]; s(e[r], e[d]); end end end end end end
  938. else if f > 27 then
  939. if f < 42 then
  940. if f <= 34 then
  941. if f >= 31 then
  942. if f > 32 then
  943. if f~ = 31 then
  944. for p = 30, 97 do
  945. if 34 >
  946. f then s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; do return end;
  947. break; end; s[e[r]] = o[e[d]];
  948. break; end;
  949. else s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; do return end;
  950. end
  951. else if f > 28 then repeat
  952. if 31~ = f then local f, h;
  953. for o = 0, 5 do
  954. if o <=
  955. 2 then
  956. if 0 < o then
  957. if -3 <= o then
  958. for a = 31, 55 do
  959. if o >
  960. 1 then f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  961. break; end; f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  962. break; end;
  963. else f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  964. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end
  965. else if o > 3 then
  966. if o~ = 4 then s[e[r]][e[d]] = e[t];
  967. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  968. else s[e[r]] = {}; n = n + 1; e = l[n]; end end end
  969. break; end; local n = e[r] s[n](p(s, n + 1, e[d])) until true;
  970. else local f, h;
  971. for o = 0, 5 do
  972. if o <=
  973. 2 then
  974. if 0 < o then
  975. if -3 <= o then
  976. for a = 31, 55 do
  977. if o >
  978. 1 then f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  979. break; end; f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  980. break; end;
  981. else f = e[r] s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  982. else s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; end
  983. else if o > 3 then
  984. if o~ = 4 then s[e[r]][e[d]] = e[t];
  985. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  986. else s[e[r]] = {}; n = n + 1; e = l[n]; end end end end end
  987. else if f < 29 then
  988. if (s[e[r]] == e[t]) then n = n + 1;
  989. else n = e[d]; end;
  990. else if 28~ = f then
  991. for o = 22, 81 do
  992. if f >
  993. 29 then local f, o;
  994. for p = 0, 4 do
  995. if p <=
  996. 1 then
  997. if 0~ = p then f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n];
  998. else s[e[r]] = s[e[d]][s[e[t]]]; n = n + 1; e = l[n]; end
  999. else if p >= 3 then
  1000. if 3 < p then s[e[r]][s[e[d]]] = e[t];
  1001. else s[e[r]] = c[e[d]]; n = n + 1; e = l[n]; end
  1002. else f = e[r] s[f](s[f + 1]) n = n + 1; e = l[n]; end end end
  1003. break; end; local n = e[r] s[n] = s[n](p(s, n + 1, e[d])) break; end;
  1004. else local f, o;
  1005. for p = 0, 4 do
  1006. if p <=
  1007. 1 then
  1008. if 0~ = p then f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n];
  1009. else s[e[r]] = s[e[d]][s[e[t]]]; n = n + 1; e = l[n]; end
  1010. else if p >= 3 then
  1011. if 3 < p then s[e[r]][s[e[d]]] = e[t];
  1012. else s[e[r]] = c[e[d]]; n = n + 1; e = l[n]; end
  1013. else f = e[r] s[f](s[f + 1]) n = n + 1; e = l[n]; end end end end end end
  1014. else if f >= 38 then
  1015. if f < 40 then
  1016. if f > 36 then repeat
  1017. if f~ = 39 then local f; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; s[e[r]] = s[e[d]] - s[e[t]];
  1018. break; end; s[e[r]] = s[e[d]][e[t]]; until true;
  1019. else local f; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; s[e[r]] = s[e[d]] - s[e[t]]; end
  1020. else if f > 38 then repeat
  1021. if f~ = 40 then local n = e[r] local r, e = b(s[n](p(s, n + 1, e[d]))) a = e + n - 1 local e = 0;
  1022. for n = n, a do e = e + 1;
  1023. s[n] = r[e]; end;
  1024. break; end; s[e[r]] = (e[d] ~ = 0); until true;
  1025. else local n = e[r] local r, e = b(s[n](p(s, n + 1, e[d]))) a = e + n - 1 local e = 0;
  1026. for n = n, a do e = e + 1;
  1027. s[n] = r[e]; end; end end
  1028. else if f > 35 then
  1029. if f == 37 then c[e[d]] = s[e[r]];
  1030. else local n = e[r] local d = {
  1031. s[n](p(s, n + 1, a))
  1032. }; local r = 0;
  1033. for e = n, e[t] do r = r + 1;
  1034. s[e] = d[r]; end end
  1035. else local e = e[r] s[e] = s[e]() end end end
  1036. else if 48 >= f then
  1037. if 44 < f then
  1038. if f < 47 then
  1039. if 43~ = f then
  1040. for l = 49, 71 do
  1041. if f~ =
  1042. 46 then
  1043. if not s[e[r]] then n = n + 1;
  1044. else n = e[d]; end;
  1045. break; end; s[e[r]][s[e[d]]] = s[e[t]];
  1046. break; end;
  1047. else if not s[e[r]] then n = n + 1;
  1048. else n = e[d]; end; end
  1049. else if 48~ = f then s[e[r]] = {};
  1050. else local p, a, u, c, h, f, b; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; f = 0;
  1051. while f > -1 do
  1052. if 3 >
  1053. f then
  1054. if f <= 0 then p = e;
  1055. else if f > -3 then repeat
  1056. if 1~ = f then u = d;
  1057. break; end; a = r; until true;
  1058. else a = r; end end
  1059. else if f < 5 then
  1060. if 1~ = f then repeat
  1061. if 4~ = f then c = p[u];
  1062. break; end; h = p[a]; until true;
  1063. else h = p[a]; end
  1064. else if f >= 3 then repeat
  1065. if f~ = 6 then s(h, c);
  1066. break; end; f = -2; until true;
  1067. else f = -2; end end end f = f + 1 end n = n + 1; e = l[n]; b = e[r] s[b] = s[b](s[b + 1]) n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; f = 0;
  1068. while f > -1 do
  1069. if f >
  1070. 2 then
  1071. if 5 > f then
  1072. if 4~ = f then c = p[u];
  1073. else h = p[a]; end
  1074. else if 3~ = f then
  1075. for e = 30, 97 do
  1076. if f <
  1077. 6 then s(h, c);
  1078. break; end; f = -2;
  1079. break; end;
  1080. else s(h, c); end end
  1081. else if 1 > f then p = e;
  1082. else if -2 <= f then
  1083. for e = 39, 61 do
  1084. if f~ =
  1085. 1 then u = d;
  1086. break; end; a = r;
  1087. break; end;
  1088. else u = d; end end end f = f + 1 end end end
  1089. else if f > 42 then
  1090. if 41~ = f then
  1091. for n = 39, 95 do
  1092. if f~ =
  1093. 44 then s[e[r]] = s[e[d]][s[e[t]]];
  1094. break; end; s(e[r], e[d]);
  1095. break; end;
  1096. else s(e[r], e[d]); end
  1097. else local l, f, p, o, t; local n = 0;
  1098. while n > -1 do
  1099. if 3 <=
  1100. n then
  1101. if n > 4 then
  1102. if n >= 1 then
  1103. for e = 24, 62 do
  1104. if 5 <
  1105. n then n = -2;
  1106. break; end; s(t, o);
  1107. break; end;
  1108. else n = -2; end
  1109. else if -1~ = n then
  1110. for e = 26, 74 do
  1111. if n~ =
  1112. 3 then t = l[f];
  1113. break; end; o = l[p];
  1114. break; end;
  1115. else t = l[f]; end end
  1116. else if 0 < n then
  1117. if n~ = 1 then p = d;
  1118. else f = r; end
  1119. else l = e; end end n = n + 1 end end end
  1120. else if 51 >= f then
  1121. if 49 < f then
  1122. if 51~ = f then local r = e[r] local d = {
  1123. s[r](p(s, r + 1, a))
  1124. }; local n = 0;
  1125. for e = r, e[t] do n = n + 1;
  1126. s[e] = d[n]; end
  1127. else s[e[r]] = s[e[d]] - s[e[t]]; end
  1128. else s[e[r]][e[d]] = s[e[t]]; end
  1129. else if 53 < f then
  1130. if f~ = 52 then repeat
  1131. if f~ = 54 then local r = e[r]; local n = s[e[d]]; s[r + 1] = n; s[r] = n[e[t]];
  1132. break; end; local o;
  1133. for f = 0, 4 do
  1134. if 1 >=
  1135. f then
  1136. if 0 == f then s(e[r], e[d]); n = n + 1; e = l[n];
  1137. else o = e[r] s[o] = s[o](p(s, o + 1, e[d])) n = n + 1; e = l[n]; end
  1138. else if 2 < f then
  1139. if f >= -1 then
  1140. for p = 40, 55 do
  1141. if f~ =
  1142. 4 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  1143. break; end;
  1144. if not s[e[r]] then n = n + 1;
  1145. else n = e[d]; end;
  1146. break; end;
  1147. else if not s[e[r]] then n = n + 1;
  1148. else n = e[d]; end; end
  1149. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end end until true;
  1150. else local o;
  1151. for f = 0, 4 do
  1152. if 1 >=
  1153. f then
  1154. if 0 == f then s(e[r], e[d]); n = n + 1; e = l[n];
  1155. else o = e[r] s[o] = s[o](p(s, o + 1, e[d])) n = n + 1; e = l[n]; end
  1156. else if 2 < f then
  1157. if f >= -1 then
  1158. for p = 40, 55 do
  1159. if f~ =
  1160. 4 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  1161. break; end;
  1162. if not s[e[r]] then n = n + 1;
  1163. else n = e[d]; end;
  1164. break; end;
  1165. else if not s[e[r]] then n = n + 1;
  1166. else n = e[d]; end; end
  1167. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end end end
  1168. else if f == 53 then local e = e[r] s[e] = s[e]()
  1169. else s[e[r]][s[e[d]]] = e[t]; end end end end end
  1170. else if 14 <= f then
  1171. if 20 >= f then
  1172. if f < 17 then
  1173. if 14 >= f then do return end;
  1174. else if 11~ = f then repeat
  1175. if f~ = 16 then local e = e[r] s[e] = s[e](s[e + 1]) break; end; s[e[r]] = s[e[d]][s[e[t]]]; until true;
  1176. else s[e[r]] = s[e[d]][s[e[t]]]; end end
  1177. else if 18 < f then
  1178. if 17~ = f then repeat
  1179. if 19 < f then n = e[d];
  1180. break; end; o[e[d]] = s[e[r]]; until true;
  1181. else o[e[d]] = s[e[r]]; end
  1182. else if 16 < f then
  1183. for o = 26, 56 do
  1184. if 17 <
  1185. f then
  1186. if (s[e[r]] <= s[e[t]]) then n = e[d];
  1187. else n = n + 1; end;
  1188. break; end; local f; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t];
  1189. break; end;
  1190. else local f; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; end end end
  1191. else if 24 <= f then
  1192. if 26 <= f then
  1193. if 26~ = f then s[e[r]] = s[e[d]][e[t]];
  1194. else s[e[r]] = s[e[d]]; end
  1195. else if f > 21 then repeat
  1196. if f~ = 24 then s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n]; s[e[r]] = c[e[d]]; n = n + 1; e = l[n]; s[e[r]][s[e[d]]] = s[e[t]];
  1197. break; end; local n = e[r] s[n] = s[n](p(s, n + 1, e[d])) until true;
  1198. else local n = e[r] s[n] = s[n](p(s, n + 1, e[d])) end end
  1199. else if f <= 21 then do return end;
  1200. else if f == 23 then
  1201. for f = 0, 3 do
  1202. if 2 >
  1203. f then
  1204. if f~ = 1 then s[e[r]] = (e[d] ~ = 0); n = n + 1; e = l[n];
  1205. else o[e[d]] = s[e[r]]; n = n + 1; e = l[n]; end
  1206. else if 3 > f then s[e[r]] = o[e[d]]; n = n + 1; e = l[n];
  1207. else if (s[e[r]] == e[t]) then n = n + 1;
  1208. else n = e[d]; end; end end end
  1209. else
  1210. for f = 0, 1 do
  1211. if f == 1 then s[e[r]][e[d]] = e[t];
  1212. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end end end end end end
  1213. else if f > 6 then
  1214. if f > 9 then
  1215. if 11 < f then
  1216. if f~ = 13 then s[e[r]] = s[e[d]][s[e[t]]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]];
  1217. else local f, o; f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n]; s(e[r], e[d]); n = n + 1; e = l[n]; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; f = e[r]; o = s[e[d]]; s[f + 1] = o; s[f] = o[e[t]]; n = n + 1; e = l[n]; f = e[r] s[f](s[f + 1]) end
  1218. else if f~ = 6 then
  1219. for n = 28, 84 do
  1220. if f~ =
  1221. 10 then s[e[r]][s[e[d]]] = e[t];
  1222. break; end; o[e[d]] = s[e[r]];
  1223. break; end;
  1224. else o[e[d]] = s[e[r]]; end end
  1225. else if f > 7 then
  1226. if f >= 5 then repeat
  1227. if f~ = 9 then local n = e[r] local d = {
  1228. s[n](s[n + 1])
  1229. }; local r = 0;
  1230. for e = n, e[t] do r = r + 1;
  1231. s[e] = d[r]; end
  1232. break; end; n = e[d]; until true;
  1233. else local r = e[r] local d = {
  1234. s[r](s[r + 1])
  1235. }; local n = 0;
  1236. for e = r, e[t] do n = n + 1;
  1237. s[e] = d[n]; end end
  1238. else s[e[r]] = k(_[e[d]], nil, o); end end
  1239. else if 3 <= f then
  1240. if f < 5 then
  1241. if 4 == f then local e = e[r] s[e](s[e + 1])
  1242. else local f, h;
  1243. for o = 0, 6 do
  1244. if 2 >=
  1245. o then
  1246. if 0 < o then
  1247. if o~ = -1 then
  1248. for f = 25, 52 do
  1249. if o~ =
  1250. 2 then s[e[r]][e[d]] = s[e[t]]; n = n + 1; e = l[n];
  1251. break; end; s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n];
  1252. break; end;
  1253. else s[e[r]][e[d]] = e[t]; n = n + 1; e = l[n]; end
  1254. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end
  1255. else if o <= 4 then
  1256. if o >= -1 then
  1257. for p = 28, 66 do
  1258. if o <
  1259. 4 then f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  1260. break; end; s(e[r], e[d]); n = n + 1; e = l[n];
  1261. break; end;
  1262. else f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n]; end
  1263. else if 1~ = o then repeat
  1264. if o~ = 5 then s[e[r]][e[d]] = s[e[t]];
  1265. break; end; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; until true;
  1266. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n]; end end end end end
  1267. else if f~ = 4 then repeat
  1268. if f~ = 6 then s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; s[e[r]] = o[e[d]]; n = n + 1; e = l[n]; s[e[r]] = s[e[d]][e[t]];
  1269. break; end; local f, h;
  1270. for o = 0, 6 do
  1271. if o >
  1272. 2 then
  1273. if o > 4 then
  1274. if o~ = 4 then repeat
  1275. if 6 > o then s(e[r], e[d]); n = n + 1; e = l[n];
  1276. break; end; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) until true;
  1277. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) end
  1278. else if -1 < o then
  1279. for p = 24, 58 do
  1280. if 3 <
  1281. o then f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  1282. break; end; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  1283. break; end;
  1284. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end
  1285. else if o > 0 then
  1286. if o >= -3 then
  1287. for t = 44, 53 do
  1288. if 1~ =
  1289. o then f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  1290. break; end; s(e[r], e[d]); n = n + 1; e = l[n];
  1291. break; end;
  1292. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  1293. else f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n]; end end end until true;
  1294. else local f, h;
  1295. for o = 0, 6 do
  1296. if o >
  1297. 2 then
  1298. if o > 4 then
  1299. if o~ = 4 then repeat
  1300. if 6 > o then s(e[r], e[d]); n = n + 1; e = l[n];
  1301. break; end; f = e[r] s[f] = s[f](p(s, f + 1, e[d])) until true;
  1302. else f = e[r] s[f] = s[f](p(s, f + 1, e[d])) end
  1303. else if -1 < o then
  1304. for p = 24, 58 do
  1305. if 3 <
  1306. o then f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n];
  1307. break; end; s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n];
  1308. break; end;
  1309. else s[e[r]] = s[e[d]][e[t]]; n = n + 1; e = l[n]; end end
  1310. else if o > 0 then
  1311. if o >= -3 then
  1312. for t = 44, 53 do
  1313. if 1~ =
  1314. o then f = e[r] s[f] = s[f](p(s, f + 1, e[d])) n = n + 1; e = l[n];
  1315. break; end; s(e[r], e[d]); n = n + 1; e = l[n];
  1316. break; end;
  1317. else s(e[r], e[d]); n = n + 1; e = l[n]; end
  1318. else f = e[r]; h = s[e[d]]; s[f + 1] = h; s[f] = h[e[t]]; n = n + 1; e = l[n]; end end end end end
  1319. else if 1 <= f then
  1320. if 0 < f then repeat
  1321. if f > 1 then s[e[r]] = s[e[d]] - s[e[t]];
  1322. break; end;
  1323. if (s[e[r]] == e[t]) then n = n + 1;
  1324. else n = e[d]; end; until true;
  1325. else s[e[r]] = s[e[d]] - s[e[t]]; end
  1326. else local f, p;
  1327. for o = 0, 1 do
  1328. if - 1~ =
  1329. o then repeat
  1330. if o~ = 1 then f = e[r]; p = s[e[d]]; s[f + 1] = p; s[f] = p[e[t]]; n = n + 1; e = l[n];
  1331. break; end; f = e[r] s[f] = s[f](s[f + 1]) until true;
  1332. else f = e[r] s[f] = s[f](s[f + 1]) end end end end end end end end n = 1 + n; end; end;
  1333. return ne end; local r = 0xff; local o = {}; local l = (1); local d = '';
  1334. (function(n) local s = n local t = 0x00 local e = 0x00 s = {
  1335. (function(r) if t > 0x21 then
  1336. return r end t = t + 1 e = (e + 0xd4f - r) % 0x2d
  1337. return (e % 0x03 == 0x1 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0xc7); end
  1338. return true end)
  1339. 'XrViS'
  1340. and s[0x3](0x21f + r)) or(e % 0x03 == 0x2 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0x96); end
  1341. return true end)
  1342. 'qLpZv'
  1343. and s[0x1](r + 0x2d5)) or(e % 0x03 == 0x0 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0xee); end
  1344. return true end)
  1345. 'CotOb'
  1346. and s[0x2](r + 0x19e)) or r end),
  1347. (function(f) if t > 0x29 then
  1348. return f end t = t + 1 e = (e + 0x912 - f) % 0x46
  1349. return (e % 0x03 == 0x2 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0x46); end
  1350. return true end)
  1351. 'rJMwU'
  1352. and s[0x3](0x10c + f)) or(e % 0x03 == 0x1 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0x50); r[2] = (r[2] * (se(function() o() end, p(d)) - se(r[1], p(d)))) + 1; o[l] = {}; r = r[2]; l = l + r; end
  1353. return true end)
  1354. 'DqqlD'
  1355. and s[0x2](f + 0x1e5)) or(e % 0x03 == 0x0 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0x1d); o[l] = de(); l = l + r; end
  1356. return true end)
  1357. 'ujMbF'
  1358. and s[0x1](f + 0x208)) or f end),
  1359. (function(f) if t > 0x27 then
  1360. return f end t = t + 1 e = (e + 0x9c3 - f) % 0x2d
  1361. return (e % 0x03 == 0x1 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0x5e); d = {
  1362. d..
  1363. '\58 a',
  1364. d
  1365. }; o[l] = ne(); l = l + ((not h.Ktgyonbv) and 1 or 0); d[1] = '\58'..d[1]; r[2] = 0xff; end
  1366. return true end)
  1367. 'hJJ_b'
  1368. and s[0x2](0x21f + f)) or(e % 0x03 == 0x2 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0x3d); d = '\37'; r = {
  1369. function() r() end
  1370. }; d = d..
  1371. '\100\43'; end
  1372. return true end)
  1373. 'mCyMX'
  1374. and s[0x3](f + 0x16f)) or(e % 0x03 == 0x0 and(function(s) if not n[s] then e = e + 0x01 n[s] = (0xf); end
  1375. return true end)
  1376. 'rQArr'
  1377. and s[0x1](f + 0x83)) or f end)
  1378. }
  1379. s[0x3](0xde1) end) {}; local e = k(p(o));
  1380. return e(...); end
  1381. return ne((function() local n = {}
  1382. local e = 0x01; local s;
  1383. if h.Ktgyonbv then s = h.Ktgyonbv(ne)
  1384. else s = ''
  1385. end
  1386. if h.GcophrRR(s, h.tWrBTqgK) then e = e + 0;
  1387. else e = e + 1; end n[e] = 0x02; n[n[e] + 0x01] = 0x03;
  1388. return n; end)(), ...) end)((function(s, e, n, r, d, l) local l;
  1389. if 3 >= s then
  1390. if 2 > s then
  1391. if s >= -2 then repeat
  1392. if s > 0 then do return function(n, e, s) if s
  1393. then local e = (n / 2 ^ (e - 1)) % 2 ^ ((s - 1) - (e - 1) + 1);
  1394. return e - e % 1;
  1395. else local e = 2 ^ (e - 1);
  1396. return (n % (e + e) >= e) and 1 or 0; end; end; end;
  1397. break; end; do return e(1), e(4, d, r, n, e), e(5, d, r, n) end;
  1398. until true;
  1399. else
  1400. do return e(1), e(4, d, r, n, e), e(5, d, r, n) end;
  1401. end
  1402. else if s >= 1 then repeat
  1403. if 3 > s then do return 16777216, 65536, 256 end;
  1404. break; end; do return e(1), e(4, d, r, n, e), e(5, d, r, n) end;
  1405. until true;
  1406. else
  1407. do return 16777216, 65536, 256 end;
  1408. end end
  1409. else if s >= 6 then
  1410. if 6 < s then
  1411. if s > 3 then
  1412. for e = 32, 78 do
  1413. if 8 >
  1414. s then do return setmetatable({}, {
  1415. ['__\99\97\108\108'] = function(e, r, d, s, n) if n then
  1416. return e[n] elseif s then
  1417. return e
  1418. else e[r] = d end end
  1419. }) end
  1420. break;
  1421. end; do return n(s, nil, n);
  1422. end
  1423. break; end;
  1424. else
  1425. do return n(s, nil, n);
  1426. end end
  1427. else
  1428. do return d[n] end;
  1429. end
  1430. else if 5 > s then local s = r; local l, f, r = d(2); do return function() local t, d, n, e = e(n, s(s, s), s(s, s) + 3);
  1431. s(4);
  1432. return (e * l) + (n * f) + (d * r) + t; end; end;
  1433. else local s = r; do return function() local e = e(n, s(s, s), s(s, s));
  1434. s(1);
  1435. return e; end; end; end end end end), ...)
Advertisement
Add Comment
Please, Sign In to add comment
Public Pastes
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!