Fraudulent Ancestry | No Stun

--[[
	Made by Megumu#8008
	<3
]]

local d=string.byte;local i=string.char;local c=string.sub;local h=table.concat;local u=math.ldexp;local C=getfenv or function()return _ENV end;local l=setmetatable;local A=select;local s=unpack;local r=tonumber;local function R(d)local e,n,a="","",{}local o=256;local t={}for l=0,o-1 do t[l]=i(l)end;local l=1;local function f()local e=r(c(d,l,l),36)l=l+1;local n=r(c(d,l,l+e-1),36)l=l+e;return n end;e=i(f())a[1]=e;while l<#d do local l=f()if t[l]then n=t[l]else n=e..c(e,1,1)end;t[o]=e..c(n,1,1)a[#a+1],e,o=n,n,o+1 end;return table.concat(a)end;local a=R('25D25C27525F25H27525C24W24J24H24S24S27427525M27925F25G27925324H24P25027K27924N24H24T24L25F25J27924024S24H25524L24Y24Z25F25N27923W24V27C24S28028228425F25K27923M24H24J24R24W28L24R27R27524325025124U27727924627D25124L25E25C25F25L27928T28V24424P27V24Y27929E29F25C25V2791V25K21C21R25Q28I25C1U25K26825C26629P1T24W27525G29Y21S1S24O29M25H24O25C21S1V25S29M25Q25S2751U25C26O25C2962AF25C23K25C25R2792AG2402AO2AQ25C24G2AT2AF26W21S2AO26W2752AA29M25R2AE29Q2AH2AX2B82AN2AP2AL2AS2BD2B82AW2BG2AG2282BA1U26W22O2B12752A321R21R25R24O21R25B29R27525I29P25C27L2B329L29N29P1R25C29M2C21U25S2AE25P2B72BZ25C2C1279');local o=bit and bit.bxor or function(l,n)local e,o=1,0 while l>0 and n>0 do local a,c=l%2,n%2 if a~=c then o=o+e end l,n,e=(l-a)/2,(n-c)/2,e*2 end if l<n then l=n end while l>0 do local n=l%2 if n>0 then o=o+e end l,e=(l-n)/2,e*2 end return o end local function e(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 n()local a,c,e,n=d(a,l,l+3);a=o(a,192)c=o(c,192)e=o(e,192)n=o(n,192)l=l+4;return(n*16777216)+(e*65536)+(c*256)+a;end;local function t()local e=o(d(a,l,l),192);l=l+1;return e;end;local function R()local o=n();local l=n();local c=1;local o=(e(l,1,20)*(2^32))+o;local n=e(l,21,31);local l=((-1)^e(l,32));if(n==0)then if(o==0)then return l*0;else n=1;c=0;end;elseif(n==2047)then return(o==0)and(l*(1/0))or(l*(0/0));end;return u(l,n-1023)*(c+(o/(2^52)));end;local f=n;local function r(e)local n;if(not e)then e=f();if(e==0)then return'';end;end;n=c(a,l,l+e-1);l=l+e;local e={}for l=1,#n do e[l]=i(o(d(c(n,l,l)),192))end return h(e);end;local l=n;local function f(...)return{...},A('#',...)end local function u()local d={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};local i={0};local l={};local a={d,nil,i,nil,l};local l=n()local c={0,0,0,0,0,0,0,0,0,0};for n=1,l do local e=t();local l;if(e==2)then l=(t()~=0);elseif(e==0)then l=R();elseif(e==3)then l=r();end;c[n]=l;end;a[2]=c for l=1,n()do i[l-1]=u();end;for a=1,n()do local c=o(n(),222);local n=o(n(),15);local o=e(c,1,2);local l=e(n,1,11);local l={l,e(c,3,11),nil,nil,n};if(o==0)then l[3]=e(c,12,20);l[5]=e(c,21,29);elseif(o==1)then l[3]=e(n,12,33);elseif(o==2)then l[3]=e(n,12,32)-1048575;elseif(o==3)then l[3]=e(n,12,32)-1048575;l[5]=e(c,21,29);end;d[a]=l;end;a[4]=t();return a;end;local function i(l,e,t)local e=l[1];local n=l[2];local c=l[3];local l=l[4];return function(...)local a=e;local o=n;local r=c;local c=l;local l=f local e=1;local d=-1;local u={};local h={...};local f=A('#',...)-1;local l={};local n={};for l=0,f do if(l>=c)then u[l-c]=h[l+1];else n[l]=h[l+1];end;end;local l=f-c+1 local l;local c;while true do l=a[e];c=l[1];if c<=8 then if c<=3 then if c<=1 then if c>0 then n[l[2]]=t[o[l[3]]];else n[l[2]][o[l[3]]]=o[l[5]];end;elseif c>2 then n[l[2]]=t[o[l[3]]];else local e=l[2];local c={};local o=0;local l=e+l[3]-1;for l=e+1,l do o=o+1;c[o]=n[l];end;n[e](s(c,1,l-e));d=e;end;elseif c<=5 then if c>4 then e=e+l[3];else if n[l[2]]then e=e+1;else e=e+l[3];end;end;elseif c<=6 then n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]][o[l[3]]]=o[l[5]];e=e+1;l=a[e];n[l[2]]=t[o[l[3]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]]=n[l[3]][o[l[5]]];e=e+1;l=a[e];n[l[2]][o[l[3]]]=o[l[5]];e=e+1;l=a[e];e=e+l[3];elseif c==7 then n[l[2]]=i(r[l[3]],nil,t);else do return end;end;elseif c<=13 then if c<=10 then if c>9 then e=e+l[3];else do return end;end;elseif c<=11 then if n[l[2]]then e=e+1;else e=e+l[3];end;elseif c>12 then n[l[2]]=i(r[l[3]],nil,t);else n[l[2]]=n[l[3]][o[l[5]]];end;elseif c<=15 then if c==14 then n[l[2]]=n[l[3]][o[l[5]]];else local e=l[2];local c={};local o=0;local l=e+l[3]-1;for l=e+1,l do o=o+1;c[o]=n[l];end;n[e](s(c,1,l-e));d=e;end;elseif c<=16 then n[l[2]][o[l[3]]]=o[l[5]];elseif c==17 then local e=l[2];local c,o={n[e]()};local o=e+l[5]-2;local l=0;for e=e,o do l=l+1;n[e]=c[l];end;d=o;else local e=l[2];local c,o={n[e]()};local o=e+l[5]-2;local l=0;for e=e,o do l=l+1;n[e]=c[l];end;d=o;end;e=e+1;end;end;end;return i(u(),{},C())();