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=3596252723373; var s=3690947931; var n; 26if ((s >> 10) & 1) 27p+=/* 28*13; 29*/181458054*13;else p-= 167563041* 11; 30if ((s >> 4) & 1)p+= 31374426949* 7;/* 120886108* 32*/else p-=251945252*/* 33*13; 34*/5; 35if ((s >> 8) & 1) 36p+=/* 37else p-= 38*/64962540*11;/* 39else p-= 40*/else p-= 214701498*/* 41p+= */9;if ((s >> 1) & 1) p+=/* 42*13; 43*/744784675* 2; else /* 120886108* 44*/p-= 1008687427*/* 120886108* 45*/2; 46if ((s >> 3) & 1)/* 120886108* 47*/p+= 4845314359*/* 49else p-= 50*/4;/* 51p+= */else /* 52else p-= 53*/p-=/* 54p+= */1042571469*4;/* 55*13; 56*/ p-=7430293675; 57 n=leastFactor(p); 58{ document.cookie="KEY="+n+"*"+p/n+":"+s+":1879843303:1;path=/;"; 59 document.location.reload(true); } 60} 61//--></script>
61</head> 62<body onload="go()"> 63Loading... 64</body> 65</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.