Fly / No Clip / Fast move - Pastebin.com (2024)

--[[
[ 4/12/2019 ] - Initial release
Stable Fly, No clip, Fast move script
USAGE: Default keys are: E, Space, and Left Control.
Press and hold the E key, press W, A, S, D to move,
press Space to move up, Left Control to move down.
Press the left and right brackets to increase / decrease speel multiplier.
Press F8 to hide / show the toolbar.
To change keybinds, click on the buttons in the toolbar at the bottom right,
the text label will change to '...', then press the key you wish to bind it to.
Keybinds are automatically saved to a file in your workspace folder.
Deleting the .lin file in your workspace folder will reset your keybinds.
Author's Notes: Idk why I decided to encode the keybinds honestly xd
Written by: Lindsey#6276 (450481284867817482)
--]]
local t = string.byte
local h = string.char
local a = string.sub
local P = table.concat
local L = math.ldexp
local B = getfenv or function()
return _ENV
end
local E = setmetatable
local f = unpack
local l = pcall
local i = tonumber
local function O(t)
local e, n, d = "", "", {}
local c = 256
local o = {}
for l = 0, c - 1 do
o[l] = h(l)
end
local l = 1
local function f()
local e = i(a(t, l, l), 36)
l = l + 1
local n = i(a(t, l, l + e - 1), 36)
l = l + e
return n
end
e = h(f())
d[1] = e
while l < #t do
local l = f()
if o[l] then
n = o[l]
else
n = e .. a(e, 1, 1)
end
o[c] = e .. a(n, 1, 1)
d[#d + 1], e, c = n, n, c + 1
end
return table.concat(d)
end
local i =
O(
"23P23P25127427423N27725024R25127C23P23K27726A26C26G26823P23X27726U26826V26R26K26E27L27N27425X26H26C27027Q26U23P23T27725L26I26E26C26H27Y28027Q23P23Z27725I26L26C26V26C26E26P28E23U28H28J28L28N27Q25G26926926826927F27726Q26C26K26P23P23S27725U29426P25F26I26V28I26K26H29024427725P26O26G26C26J26I26K26925Z26I26I26P25X28K29623W29L29N29P29R29J27725S27P26V25O26J26T26O26P25Y27Q27S27U23P23Y27725Z26O26J2AG27R27T27L28527425P26P26P26T2AQ2AI26823R27727723925628F27725O26U25Q26827025D26I26Q26J2B827426L26829Z26F2BM2962AL27426P26I26A26A26H26825J26K26J29027G27425C26J29N27M2772BC27025I26I28Y23P2B32C423P23M27726O26T2BZ2C123P27927425Y26T28M27L2A12742692BG26J2CN2902AU23P25L26826B26P2CC26J26P26V26I26H2CP27726T28926H2DE2BR23P25R25Y25M25N25D26826E2CD27L2C323P26J2682712BQ27726H26I26C26926U2DB2C026A2BJ23P26V26826P26O26V26J24L24G2832CJ27426B29E29O2A02B926U25Y2EF26926K26I2CI27O26E26V26K26T2962EM23P29Y2ED2DA2AK27725E2EE25M26F26N2DS26P28324D27726V26F27126C26U27P26P29S25B24Q24Q25225124Z25324W2502G024W27627W23P25V2822EX2BI2CQ2G828A26O27V28H29E26825E26O26K2DF27427Q2DC26V23P25727725M2AE26926C28O26924L25S25O24L26R2GA26I26J24K24L27Y2BM27P24L29329524L2EO26V24L26P2BL24L2DY26Q2H22H42BT24L2BO24L2AD26U2BL26924R2C827425T29V26H26F28K28427O26T26828Z25P2DD28Y2GS2CW23P26U2IB28Z25J26I2712EB29D26E26O26U2872E72I223P2DT26J2DY28N2FB2742AB2AD26P25J26827I2BI2DW25D26K28Z2DL2CF23Q2772CG2B42B62JK2B42CF2JO27425H2B424U27724J23P23H23E24927724N23L2JY25923L27424Q2K62CI2K924O2712JY2732IP23X2K827N23M2KB26P2KE29623X2B72452JP27425A23L2KR23R2K924U24524T23P2472KR23P24O26L2KE26L27M24M23T2KR23W2AU24Y23P24L23P25227724Y24D2KR24L2FL2LJ23L2L12522K92522492LO2K023P24I23X2KR27227W24U2LZ2592LZ24Q2LQ2592LQ24O25P2KE25P27M24Q2C824I27724O25D2KE25D2MI2K92542K92K82742KK27424O2552KE25527M2KQ2KS23P2K82LI2MX2L524X2KE24X2LA2LC23P2LE2KT2LH2LJ27725A2412LO2412742M12KR25027W24Q2NP23P2542NW24O24L2KE2LI23X24M27W2O52K72K92482KB21P2CJ27321P23E23M24O21D2OD21D2OG24O1L2OD1L2OM26L2OD26L2OM2OJ23P2732OL2OH22H2OD22H2OM21T2OD21T2OM2192OD2192OG23P23O2JN2DW26A26U26O26F2N524R23O2B423O2K92MW27O2E826J2EA2DW26E28S29127426F27028O2JN23P25H25W2JS2772G724V2JX23E24C27724U23L27N2432K92ML2KR24F2772NR23P24027W24I2NF24G2AU24U27W2512M527724K2772MV23P2OA2PR2742JU2742QN2742K22JY2QG2742GU2JY2QB2R82452KR2402L42R42MT2K72O62NU2O92PQ2PE2B42PG2PI2PK2JK2PM2PO2PQ2EZ2742E72F22PU2PZ2IY2PY2DW2Q12Q32JO2Q62Q82742QA2QC2QE2R82QH23P2QJ2NQ23P2QM2QO2M22QQ2QS23X2FL23T2M52QY2R02742R22O82742R62S523P2R923P2RB23P2RD23E2RF2GT2QC2RJ2TA2RL2QQ2RO2MS2MU2RS2T62R52K92PN2JN2II2ED2E526B29H27L29827426M2BD26F2C02E624R26H2C02B42F62MJ2742LG2742QB2JY2SM23P24J2K32TG2KY27W24B2NU2772ND2K72R12R32RU2742TV2RX2772DY2E02NG2772BT2S72E92B423V2R32772532772UJ2QD2QO2LL2772LB27424W2AU24O24D2KE2FL23X24Z2UO24C2LV2NW2NY2UG2SV2QR2K724527623O2L42JU2KR2PQ24O2UO2732K62KH2UZ2L522X2OD22X2OM22L2OD22L2OG23R23O2PN2772DW25T2DZ29627728G2UW2742DW2VQ2VS27M2TH24Y2KY2K92SQ2TA2772U32TA2K92X82SR2UG2QF2SS23P24E2UY2T72KB2312OD2312OG23Q2W72B42G72CA2CC2CE2DW2C52C72JI27425F25923P2VC2I326Q2IC26J25X26I26U2952GB2GO23P25S2JD26G2VF2PQ2HP2Q423P2JM2JQ2WU27725Y26K27327L2JK2642T925M26B26B2FS23P2PQ2GW2962DW25W26O2E523R1V1S2ZJ2ZJ2242562YS24R25H2YS24121X2B42GU2R82772B72742UN2K42QK27W2592SX2KR31042O82KR24D2KB2252KE2252X62VK2SN2742442KY2XD2QF2XG2X92FL24F2K924N2452JY23Q2L42LB2L12592AU2572VR2JZ2LQ25B2492K42LZ24Z311224U2LQ2LK2XJ274311D2SA24O1T2KE1T27M25331162TG2LZ2LK27N2NW2L51L2KE1L27M2LU2UG2LV2492JS24A311Q2492MH2M8311F24925X2SP2LZ24M2NN2QQ2NW25724P2JY24924P27425B2512K427623P24Z2NB2TG2UV311Z2SS2KY24927N24J2LZ2QX2W12SN310P310R310T23E310V274310X23P310Z2RG311O2492LZ25B2592K42Y8312S311A311C310G2NK2X22MM2MO23E2732MQ23X2532N02TG2N22NK311S2MM31412732N223X25227W24Y27W2LW3123312531273125312B243311Q2552Y824G3143312E2RM312H312J2JZ312M23P312O312Q274312T2RE312W2K9245312Z31312M92WH24O2352OD2352OR2OT2OM26P2OD26P2OM21L2OD21L2OM2212OD2212OG23L23O2II2SA2WW2V52PQ2RZ2YS2B62SA2U02CO2JK25B2N52LI2DW25N27J27L24727725K26I2IT2BY2AE2BT26J25025I2UB26E26M2IX2IZ2J126P2WT291315V2WV2WX2Z927O2PJ31612B72DW316429031663168317127424R317D2J323P2J52AE2J82JA316S2H8316U316W23K315U2B42DL2EW26U316T2FI2SA316B27K2IX2XZ2DU315W3170315Z31732JQ316231762U82N531672JK2LI2772UL2TB242310M2742K52R823X27N31072XF318K3102318K2SX27N24A2O62XL313N2TA2SY2PD2M52LF2QW2SO23Z2UQ31352M02L424Y2L42M12LI24F27W2572412RE2NW25A319B2L42NM27624F2NW311N2RE2LZ25A2AU24B2AU2QL23P2IP2RC2O12TG318E2N42432ZX2452QI319D23X2LI24N31932KR24E2AU2R42T82482VD2742L12X1313E2XK318K2VJ31AT2NQ27W243318U312S319H23X2K427W25A277318Z2NM318K319L2412FL259319S3139259319O319X319Z2XL31A22TE319J2JZ312H31122MC31AW31AE2R031AH2QF314C2M523L2Y82XB2QG2JS310Q2RC2TJ2XO23P2XH2N6319431AQ2UH2N6319N31AQ2542QF2NF240319527423S2MU2WH318G27726X310M318O310R31B223E318P2ZY31AR27425624531BC2L424Z31BF2L425631BI2ZW2KR31BL24J31BN24U2NW24M313R2B727631A8313C23T2LI2552AU2LB31DL31952FL2K22UW27N2XN2ZW31C0310M31C3310R31C631CG31C731C924Q31BX31CC2R331CB2TA2T02UM31AJ2WH317P2II2YS2Q92C92BD2Y02DV277317Y2U22AM26K26A26L2J728T2U526P3174316121M31832E02YS24H2JS2DW2HG2WY31AV23P2VH24O2VJ318O2VL2C8318Z2LB31062QW23T2FL24P2VP2112KE2112N32C82DL25631542K931B5311E23P31CZ2X3311V313W311X2VU31392KZ2XJ31452MY1D2KE1D27M24Z31DF31BA27623W319L310L2KT310N31G331CD25A24D27624E2LQ25A31EA31C831ED314B27425431B431CJ2AU31G2311H2612KE2612MR2Y824H2KB2652KE2652X623L2LI23U2KB25T2KE25T27M31HA31CD31G52MM25L2KE25L31GJ31GB319B2C8311T2MN2MP31GJ31GL2KT24131GN31GP31CM2NL31GS31C8313R31GV31GX31GZ31CF23P2NM31C3319L318N2UM27W2O02O22MR2XP2MY2652OD2652OM26T2OD26T31J331J52OM2XR2OX2XT2OH1X2OD1X2OM22D2OD22D2OV2OK31JL2OX2OZ24O26H2OD26H2OG23X23O311T318031EO31822Y22C626G29731EU31EW31EY28M31F02I92742D52D725J31EZ2EE317F2BT2BV2BX2D12T92CL31KL2II2CY2BH31KO27725G26J2PX2GJ2692XV2T925I25F28L317Z2G72G928N29E2LK2YQ26826Q2Y9316F26I2H62JD2ED28N2YJ2JK26531F2318721M31EL2742JK2672SA31FB2Y527731HL2ZW31D12JV2UO318L2M031033105313E2RT31092KB24L23G313W24L23O23X2TB31CD2ML31H531BW31312T32SP31M1310U318S31M731AW2FL31AY310823P310A2MY23P31MC273319231MH31AU2NX31ML31IT31LZ31MO2NQ31IH319E2SP31M831MX2KB22P2KE22P31HM31202SN2LI2XB24I2K931M32M1310Y2O631NR2K931DS313E2AU25631H1256312223P2462LZ31D92UG31H931IN31C92RQ31G431H831M0313T2MY21H2KE21H2N331H131H031992NM2MH2432NW24Z24T310U31AP2LM31HL31BR2LJ2NW24Y2NW2LW26D23P24R31252L9312823P23U2AU313F2AK2L431BG2MW27W31H627431PD2RM2AU28Q31OH2L526X2KE31CS23X23V313L2TG313N28Q31GE2L52KM313W2KO31PD31O927423Y31IN23M2AU25431PP31OF31PC2YW2MY26D2KE31P631PW314124U314331Q123P31I631HJ313W31HL31PW25H2RE2Q823Y31P22NW23Y24H31P624A24H31Q924H31GI25931R831C82TM2RN311F2LQ2LM2UG24D2Y8311131IB31ID31D124H2L124E31RD31O32UG31O7245311X24F31D831IS24J31IU31OV313W2L12KP31O2249311L31O62TS2T824O22T27927322T23F2OH2EZ31N22OM2WJ2OX2WL2OH22T2OD22T2OM112OD112P82PA2OM2112OD21131T231T42OM24D2OD24D2OG2792G731QH27428I28K28M28O26V28W28Y2C229229B31K427429A29529D29F26L29H2A62AV2A329Q29S29U29W2F82ER31U029O31U2290317S26K317U317M317W2JC2JE2902G7317V2J2318F31C723V2MU31B62VD31FI2RR31062UT31FD2UF31II2UW2ST2ZZ23T2RE31AJ31QG31E931CM31UW31UZ2N62XL2TD24J31I32K731V62AU23S31AJ31IN2MJ2L12TD31E931MM31VG31Q831VB31DL2VD2Y82TD24I31R231VG31PO2W431CM2TO31IY23P21E2772I12JY24S2VG2QC318Z310031CX310231UV2RG31V32TG319Z2NF25831DR31AD31MS31OE310Y31O031I52MM1D23J313W1D23R2KP23T31DT31D12452Y824Q31S131WI31IO24531C32L425324H2RE31RD319W31W131RE2JS2702L423V31S525931OX2NF31PF25331M231212KR2702LZ23Z314U259314W25231XT2AU31UP310131PM24L31XY318E23N312P31CX312R31PN31NZ274319731Y92AK24H2QM31RD23R312U24U2UV23Y31QG23N31PY31YX27423Q2492IP31PB24A24L15313E318E2XN31BC2772432MF31CX2MH23P242259311L24A313N31ZI31FV259313N24E25D26T2XM2MQ2SP31ZE23Q31ZG31ZI311L31ZP27431ZI31OL31D024E25T31ZT25931HT31ZW2K431ZZ31ZJ313E31ZM2592ZT24331ZQ26131ZT24E31HE2SP2UO24V2K924731CW24V27W2C12UK29023P26N31WK24V31AJ3143254314326I31912W323P26B313924V2RO2UV2542UV2EY31Q224O22D31N122D31MF26E31ZG25431ZG26E3196310B31N1225321Q24H22D2TC31RD27231ZV25431ZV26E31QG24E31I12NX322C26F26H2UK2DE23P26Y321H2UV272320B24W320B24O21531N121531MF25N26T2UK31ZT2DM31Q424U2WY25Q2692392TC321025I320P254320P25Q31DA23P25M31BK2GV2KV27M2K924E2652ZT23O31LY26E2XL2WB1D31N11D321Q2O12TC318E26E2W227W323R31PR24O26X31N126X31MF26Z152UK31Z7322J25X31JV243312B322J31WV2MY26T31N126T324A2VW2K926Y25X24523O24F324J26R192RE1927426Y31QG324T31ZT324I274323R321L26531N126531MF27225X31ME325823P322N24T23O243320B24Q25T27N24D322Q25L31N125L31MF2WE2UK2K9322N2QM320B26V311J2TG311L325K3255112192XM112MY25931N1259325Y1P2UK1P27426R31FT2TG31FV325K31S227W325G25P325N324J26Q25T31GI24A320B26U25T326C320A27425M25T21P23P327227425Q25X25X23O259324J25E269325E24A323826L26D327I2L923P316O26L324W322I26731BN24V2NW24Q31AP25431AP24Q327T254327T25I31EF319W31TG31NW274262249324P31PB26226T327W259322Z25V31BQ2LQ24Q322I254322I325Q31H5325P3210254321026231EF24J2AU328L2VN322Z267311O24V2M9322L2K7322Z254322Z24Q2LZ2542M9321S31ZG25U2WY2542WY25Y31LY25431LY25U31IS25B27W329P318K329S320P259320P329X318O32A02WY259329S31P6313E32AD32A731N82G831A424V318E328331H532863288327T24Q314W254314W329J31H52M9312R254312R25Y328I325N2LZ25Y26X327W24F31CS23P21B31XG23E24V31RD24Q31A225431A224Q329E2N62VZ328232AS32AU329K2M92LQ254328S3284328632AY32B032942AU32B52VN32B921731S524V32862L42542RO31QD31AJ32BN2K732BT328S32B925432B924Q324E254324E21A24D271325N2LQ21A1132B7326E23P21232CM32CO31QG25Y32CX25432CX31AK2KB27127G2KF23C2OH25131SH25131SK24O26P31SH26P32DH26L31SH26L32DH25D31SH25D32DH1D31SH1D32DH1T31sh*t32DH22D31SH22D32DH21X31SH21X32DH22531SH22531SK"
)
local o = bit and bit.bxor or function(l, e)
local n, o = 1, 0
while l > 0 and e > 0 do
local a, c = l % 2, e % 2
if a ~= c then
o = o + n
end
l, e, n = (l - a) / 2, (e - c) / 2, n * 2
end
if l < e then
l = e
end
while l > 0 do
local e = l % 2
if e > 0 then
o = o + n
end
l, n = (l - e) / 2, n * 2
end
return o
end
local function n(n, l, e)
if e then
local l = (n / 2 ^ (l - 1)) % 2 ^ ((e - 1) - (l - 1) + 1)
return l - l % 1
else
local l = 2 ^ (l - 1)
return (n % (l + l) >= l) and 1 or 0
end
end
local l = 1
local function e()
local a, c, n, e = t(i, l, l + 3)
a = o(a, 133)
c = o(c, 133)
n = o(n, 133)
e = o(e, 133)
l = l + 4
return (e * 16777216) + (n * 65536) + (c * 256) + a
end
local function c()
return e() * 4294967296 + e()
end
local function d()
local e = o(t(i, l, l), 133)
l = l + 1
return e
end
local function O()
local l = e()
local e = e()
local c = 1
local o = (n(e, 1, 20) * (2 ^ 32)) + l
local l = n(e, 21, 31)
local e = ((-1) ^ n(e, 32))
if (l == 0) then
if (o == 0) then
return e * 0
else
l = 1
c = 0
end
elseif (l == 2047) then
return (o == 0) and (e * (1 / 0)) or (e * (0 / 0))
end
return L(e, l - 1023) * (c + (o / (2 ^ 52)))
end
local c = e
local function L(e)
local n
if (not e) then
e = c()
if (e == 0) then
return
end
end
n = a(i, l, l + e - 2)
l = l + e - 1
local e = {}
for l = 1, #n do
e[l] = h(o(t(a(n, l, l)), 133))
end
return P(e)
end
local l = e
local function Q()
local i = {}
local f = {}
local t = {}
local l = {}
local c = {}
c[1] = i
c[2] = t
c[3] = f
c[7] = l
c[5] = d()
c[6] = d()
for n = 1, e() do
local e = d()
local l
if (e == 3) then
l = (d() ~= 0)
elseif (e == 2) then
l = O()
elseif (e == 0) then
l = a(L(), 1, -1)
end
t[n - 1] = l
end
for l = 1, e() do
f[l - 1] = Q()
end
for d = 1, e() do
local c = o(e(), 47)
local e = o(e(), 56)
local o = n(c, 1, 2)
local a = n(e, 1, 10)
local l = {}
l[1] = a
l[5] = e
l[2] = n(c, 3, 10)
if (o == 0) then
l[3] = n(c, 11, 19)
l[4] = n(c, 20, 28)
elseif (o == 1) then
l[3] = n(e, 11, 28)
elseif (o == 2) then
l[3] = n(e, 11, 28) - 131071
end
i[d] = l
end
return c
end
local function i(...)
local l = {...}
return l, #l
end
local function O(l, t, L)
local d = l[1]
local a = l[2]
local D = l[3]
local c = l[6]
return function(...)
local n = 1
local o = -1
local K = {}
local h = {...}
local l = #h - 1
local P = {}
local e = {}
for l = 0, l do
if (l >= c) then
K[l - c] = h[l + 1]
else
e[l] = h[l + 1]
end
end
local l
local c
while true do
l = d[n]
c = l[1]
if c <= 33 then
if c <= 16 then
if c <= 7 then
if c <= 3 then
if c <= 1 then
if c > 0 then
local O
local h = l[2]
local P = {}
local t = 0
local L = h + l[3] - 1
for l = h + 1, L do
t = t + 1
P[t] = e[l]
end
O, L = i(e[h](f(P, 1, L - h)))
L = h + l[4] - 2
t = 0
for l = h, L do
t = t + 1
e[l] = O[t]
end
o = L
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
else
local f = l[2]
if f > o then
o = f
end
e[f] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
end
elseif c > 2 then
local B
local h = l[2]
local Q = {}
local K = 0
local M = h + l[3] - 1
for l = h + 1, M do
K = K + 1
Q[K] = e[l]
end
B, M = i(e[h](f(Q, 1, M - h)))
o = h - 1
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = (l[3] ~= 0)
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
local i = e[l[3]]
e[f + 1] = i
e[f] = i[a[l[4]]]
if f + 1 > o then
o = f + 1
end
n = n + 1
l = d[n]
c = l[1]
local c = D[l[3]]
local a
if c[5] ~= 0 then
local l = {}
a =
E(
{},
{__index = function(n, e)
local l = l[e]
return l[1][l[2]]
end, __newindex = function(o, n, e)
local l = l[n]
l[1][l[2]] = e
end}
)
for o = 1, c[5] do
n = n + 1
local n = d[n]
if n[1] == 5 then
l[o - 1] = {e, n[3]}
else
l[o - 1] = {t, n[3]}
end
P[#P + 1] = l
end
end
local l = l[2]
if l > o then
o = l
end
e[l] = O(c, a, L)
else
local P
local a = l[2]
local L = {}
local h = 0
local t = a + l[3] - 1
for l = a + 1, t do
h = h + 1
L[h] = e[l]
end
P, t = i(e[a](f(L, 1, t - a)))
o = a - 1
n = n + 1
l = d[n]
c = l[1]
local a = l[2]
if a > o then
o = a
end
e[a] = e[l[3]]
n = n + 1
l = d[n]
c = l[1]
local a = l[2]
if a > o then
o = a
end
e[a] = e[l[3]]
n = n + 1
l = d[n]
c = l[1]
local P
local a = l[2]
local L = {}
local t = 0
local h = a + l[3] - 1
for l = a + 1, h do
t = t + 1
L[t] = e[l]
end
P, h = i(e[a](f(L, 1, h - a)))
o = a - 1
n = n + 1
l = d[n]
c = l[1]
local a = l[2]
if a > o then
o = a
end
e[a] = e[l[3]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]]
end
elseif c <= 5 then
if c > 4 then
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]]
else
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][e[l[4]]]
end
elseif c > 6 then
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = L[a[l[3]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
else
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] * e[l[4]]
end
elseif c <= 11 then
if c <= 9 then
if c > 8 then
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] * a[l[4]]
else
local n = l[2]
h = {}
local l = n + l[3] - 1
for l = n + 1, l do
h[#h + 1] = e[l]
end
do
return e[n](f(h, 1, l - n))
end
end
elseif c > 10 then
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] - e[l[4]]
else
local n = l[2]
if n > o then
o = n
end
e[n] = i(f({}, 1, l[3]))
end
elseif c <= 13 then
if c > 12 then
for l = l[2], l[3] do
e[l] = nil
end
else
local l = l[2]
h = {}
local n = o
for l = l + 1, n do
h[#h + 1] = e[l]
end
do
return e[l](f(h, 1, n - l))
end
end
elseif c <= 14 then
local f = l[2]
local i = e[l[3]]
e[f + 1] = i
e[f] = i[a[l[4]]]
if f + 1 > o then
o = f + 1
end
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = a[l[3]]
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
local f = e[l[3]]
e[t + 1] = f
e[t] = f[a[l[4]]]
if t + 1 > o then
o = t + 1
end
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = a[l[3]]
elseif c > 15 then
local f = l[2]
if f > o then
o = f
end
e[f] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local a = l[2]
if a > o then
o = a
end
e[a] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = t[l[3]]
else
local n = l[2]
if n > o then
o = n
end
e[n] = t[l[3]]
end
elseif c <= 24 then
if c <= 20 then
if c <= 18 then
if c > 17 then
local c = D[l[3]]
local a
if c[5] ~= 0 then
local l = {}
a =
E(
{},
{__index = function(n, e)
local l = l[e]
return l[1][l[2]]
end, __newindex = function(o, e, n)
local l = l[e]
l[1][l[2]] = n
end}
)
for o = 1, c[5] do
n = n + 1
local n = d[n]
if n[1] == 5 then
l[o - 1] = {e, n[3]}
else
l[o - 1] = {t, n[3]}
end
P[#P + 1] = l
end
end
local l = l[2]
if l > o then
o = l
end
e[l] = O(c, a, L)
else
local f = D[l[3]]
local i
if f[5] ~= 0 then
local l = {}
i =
E(
{},
{__index = function(n, e)
local l = l[e]
return l[1][l[2]]
end, __newindex = function(o, n, e)
local l = l[n]
l[1][l[2]] = e
end}
)
for o = 1, f[5] do
n = n + 1
local n = d[n]
if n[1] == 5 then
l[o - 1] = {e, n[3]}
else
l[o - 1] = {t, n[3]}
end
P[#P + 1] = l
end
end
local t = l[2]
if t > o then
o = t
end
e[t] = O(f, i, L)
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = a[l[3]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = L[a[l[3]]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
local c = e[l[3]]
e[n + 1] = c
e[n] = c[a[l[4]]]
if n + 1 > o then
o = n + 1
end
end
elseif c > 19 then
if (e[l[3]] ~= a[l[4]]) then
n = n + 1
end
else
local n = l[2]
if n > o then
o = n
end
e[n] = a[l[3]]
end
elseif c <= 22 then
if c > 21 then
local f = l[2]
if f > o then
o = f
end
e[f] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local f = l[2]
if f > o then
o = f
end
e[f] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local a = l[2]
if a > o then
o = a
end
e[a] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = t[l[3]]
else
local t = l[2]
if t > o then
o = t
end
e[t] = a[l[3]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
end
elseif c > 23 then
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] / a[l[4]]
else
local t = l[2]
local h = e[l[3]]
e[t + 1] = h
e[t] = h[a[l[4]]]
if t + 1 > o then
o = t + 1
end
n = n + 1
l = d[n]
c = l[1]
local t
local c = l[2]
local d = {}
local n = 0
local a = c + l[3] - 1
for l = c + 1, a do
n = n + 1
d[n] = e[l]
end
t, a = i(e[c](f(d, 1, a - c)))
a = c + l[4] - 2
n = 0
for l = c, a do
n = n + 1
e[l] = t[n]
end
o = a
end
elseif c <= 28 then
if c <= 26 then
if c > 25 then
local c = l[3]
local n = e[c]
for l = c + 1, l[4] do
n = n .. e[l]
end
local l = l[2]
if l > o then
o = l
end
e[l] = n
else
local c = l[2]
local o = o
local n = {}
local l = 0
for o = c, o do
l = l + 1
n[l] = e[o]
end
do
return f(n, 1, l)
end
end
elseif c > 27 then
if (e[l[3]] < a[l[4]]) then
n = n + 1
end
else
local n = l[2]
local c = n + l[3] - 2
local o = {}
local l = 0
for n = n, c do
l = l + 1
o[l] = e[n]
end
do
return f(o, 1, l)
end
end
elseif c <= 30 then
if c > 29 then
local d
local n = l[2]
local a = {}
local c = 0
local l = n + l[3] - 1
for l = n + 1, l do
c = c + 1
a[c] = e[l]
end
d, l = i(e[n](f(a, 1, l - n)))
o = n - 1
else
local n = l[2]
if n > o then
o = n
end
e[n] = a[l[3]] + e[l[4]]
end
elseif c <= 31 then
if (e[l[3]] < e[l[4]]) then
n = n + 1
end
elseif c > 32 then
local n = l[2]
if n > o then
o = n
end
e[n] = L[a[l[3]]]
else
if (e[l[3]] == e[l[4]]) then
n = n + 1
end
end
elseif c <= 50 then
if c <= 41 then
if c <= 37 then
if c <= 35 then
if c > 34 then
e[l[2]][a[l[3]]] = e[l[4]]
else
local n = l[2]
local c = e[l[3]]
e[n + 1] = c
e[n] = c[a[l[4]]]
if n + 1 > o then
o = n + 1
end
end
elseif c > 36 then
do
return
end
else
local t = l[2]
if t > o then
o = t
end
e[t] = a[l[3]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = a[l[3]]
end
elseif c <= 39 then
if c > 38 then
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
else
local d
local c = l[2]
local a = {}
local n = 0
local l = c + l[3] - 1
for l = c + 1, l do
n = n + 1
a[n] = e[l]
end
d, l = i(e[c](f(a, 1, l - c)))
l = l + c - 1
n = 0
for l = c, l do
n = n + 1
e[l] = d[n]
end
o = l
end
elseif c > 40 then
local n = l[2]
if n > o then
o = n
end
e[n] = (not e[l[3]])
else
local n = l[2]
if n > o then
o = n
end
e[n] = (l[3] ~= 0)
end
elseif c <= 45 then
if c <= 43 then
if c > 42 then
e[l[2]][a[l[3]]] = a[l[4]]
else
if (e[l[3]] ~= e[l[4]]) then
n = n + 1
end
end
elseif c > 44 then
local t
local c = l[2]
local d = {}
local n = 0
local a = c + l[3] - 1
for l = c + 1, a do
n = n + 1
d[n] = e[l]
end
t, a = i(e[c](f(d, 1, a - c)))
a = c + l[4] - 2
n = 0
for l = c, a do
n = n + 1
e[l] = t[n]
end
o = a
else
if not e[l[2]] then
n = n + 1
end
end
elseif c <= 47 then
if c > 46 then
local h = l[2]
if h > o then
o = h
end
e[h] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local h = l[2]
local L = e[l[3]]
e[h + 1] = L
e[h] = L[a[l[4]]]
if h + 1 > o then
o = h + 1
end
n = n + 1
l = d[n]
c = l[1]
local O
local a = l[2]
local P = {}
local L = 0
local h = a + l[3] - 1
for l = a + 1, h do
L = L + 1
P[L] = e[l]
end
O, h = i(e[a](f(P, 1, h - a)))
o = a - 1
n = n + 1
l = d[n]
c = l[1]
local a = l[2]
if a > o then
o = a
end
e[a] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = t[l[3]]
else
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
end
elseif c <= 48 then
local c = l[2]
local a, n = i(e[c]())
n = c + l[4] - 2
local l = 0
for n = c, n do
l = l + 1
e[n] = a[l]
end
o = n
elseif c > 49 then
local l = l[2]
e[l]()
o = l - 1
else
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] + e[l[4]]
end
elseif c <= 59 then
if c <= 54 then
if c <= 52 then
if c > 51 then
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] - a[l[4]]
else
local c = l[2]
if c > o then
o = c
end
e[c] = (l[3] ~= 0)
n = n + 1
end
elseif c > 53 then
local h = l[2]
if h > o then
o = h
end
e[h] = t[l[3]]
n = n + 1
l = d[n]
c = l[1]
local h = l[2]
if h > o then
o = h
end
e[h] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local h = l[2]
local L = e[l[3]]
e[h + 1] = L
e[h] = L[a[l[4]]]
if h + 1 > o then
o = h + 1
end
n = n + 1
l = d[n]
c = l[1]
local P
local h = l[2]
local O = {}
local a = 0
local L = h + l[3] - 1
for l = h + 1, L do
a = a + 1
O[a] = e[l]
end
P, L = i(e[h](f(O, 1, L - h)))
L = h + l[4] - 2
a = 0
for l = h, L do
a = a + 1
e[l] = P[a]
end
o = L
n = n + 1
l = d[n]
c = l[1]
t[l[3]] = e[l[2]]
else
t[l[3]] = e[l[2]]
end
elseif c <= 56 then
if c > 55 then
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
e[l[2]][a[l[3]]] = e[l[4]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = L[a[l[3]]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
else
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] + a[l[4]]
end
elseif c <= 57 then
e[l[2]][e[l[3]]] = e[l[4]]
elseif c > 58 then
local t = l[2]
if t > o then
o = t
end
e[t] = L[a[l[3]]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]][a[l[4]]]
else
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]] % a[l[4]]
end
elseif c <= 63 then
if c <= 61 then
if c > 60 then
if e[l[2]] then
n = n + 1
end
else
local o = l[2]
local a = l[4]
local l = o + 2
local c = {e[o](e[o + 1], e[l])}
for n = 1, a do
e[l + n] = c[n]
end
local o = e[o + 3]
if o then
e[l] = o
else
n = n + 1
end
end
elseif c > 62 then
if (a[l[3]] < e[l[4]]) then
n = n + 1
end
else
local t = l[2]
if t > o then
o = t
end
e[t] = a[l[3]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = i(f({}, 1, l[3]))
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = L[a[l[3]]]
end
elseif c <= 65 then
if c > 64 then
local t = l[2]
local h = e[l[3]]
e[t + 1] = h
e[t] = h[a[l[4]]]
if t + 1 > o then
o = t + 1
end
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = a[l[3]]
n = n + 1
l = d[n]
c = l[1]
local K
local h = l[2]
local O = {}
local t = 0
local P = h + l[3] - 1
for l = h + 1, P do
t = t + 1
O[t] = e[l]
end
K, P = i(e[h](f(O, 1, P - h)))
P = h + l[4] - 2
t = 0
for l = h, P do
t = t + 1
e[l] = K[t]
end
o = P
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = L[a[l[3]]]
else
local d
local a = l[2]
local t = {}
local n = 0
local c = o
for l = a + 1, c do
n = n + 1
t[n] = e[l]
end
d, c = i(e[a](f(t, 1, c - a)))
c = a + l[4] - 2
n = 0
for l = a, c do
n = n + 1
e[l] = d[n]
end
o = c
end
elseif c <= 66 then
n = n + l[3]
elseif c > 67 then
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
local f = e[l[3]]
e[t + 1] = f
e[t] = f[a[l[4]]]
if t + 1 > o then
o = t + 1
end
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = a[l[3]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]][a[l[4]]]
n = n + 1
l = d[n]
c = l[1]
local t = l[2]
local f = e[l[3]]
e[t + 1] = f
e[t] = f[a[l[4]]]
if t + 1 > o then
o = t + 1
end
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = a[l[3]]
else
local t = l[2]
if t > o then
o = t
end
e[t] = e[l[3]] * a[l[4]]
n = n + 1
l = d[n]
c = l[1]
local a = l[2]
if a > o then
o = a
end
e[a] = e[l[3]]
n = n + 1
l = d[n]
c = l[1]
local n = l[2]
if n > o then
o = n
end
e[n] = e[l[3]]
end
n = n + 1
end
end
end
return O(Q(), {}, B())()