1<html><head>
1<script type="text/javascript"><!-- 2function leastFactor(n) { 3 if (isNaN(n) || !isFinite(n)) return NaN; 4 if (typeof phantom !== 'undefined') return 'phantom'; 5 if (typeof module !== 'undefined' && module.exports) return 'node'; 6 if (n==0) return 0; 7 if (n%1 || n*n<2) return 1; 8 if (n%2==0) return 2; 9 if (n%3==0) return 3; 10 if (n%5==0) return 5; 11 var m=Math.sqrt(n); 12 for (var i=7;i<=m;i+=30) { 13 if (n%i==0) return i; 14 if (n%(i+4)==0) return i+4; 15 if (n%(i+6)==0) return i+6; 16 if (n%(i+10)==0) return i+10; 17 if (n%(i+12)==0) return i+12; 18 if (n%(i+16)==0) return i+16; 19 if (n%(i+22)==0) return i+22; 20 if (n%(i+24)==0) return i+24; 21 } 22 return n; 23} 24function go() { 25 var p=1988801650682; var s=2394553708; var n; 26if ((s >> 15) & 1)/* 27p+= */p+= 153946212*/* 120886108* 28*/16;/* 29p+= */else 30p-= 202493154*/* 31else p-= 32*/16; 33if ((s >> 8) & 1) p+=/* 120886108* 34*/68824176*11; 35else p-=/* 36p+= */388794019*9; 37if ((s >> 2) & 1) 38p+=/* 39else p-= 40*/463226333* 5;/* 41else p-= 42*/else p-= 43119504674*/* 120886108* 44*/3;/* 45p+= */if ((s >> 5) & 1)/* 46p+= */p+=/* 47*13; 48*/179491160*/* 49p+= */6; else /* 50*13; 51*/p-=/* 52*13; 53*/703230935* 546;/* 55*13; 56*/if ((s >> 2) & 1) 57p+=284162842*/* 58*13; 59*/5;else p-= 60915609497* 613;/* 62else p-= 63*/ p-=8228175856; 64 n=leastFactor(p); 65{ document.cookie="KEY="+n+"*"+p/n+":"+s+":636426174:1;path=/;"; 66 document.location.reload(true); } 67} 68//--></script>
68</head> 69<body onload="go()"> 70Loading... 71</body> 72</html>
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.