//---------------------------------------------------------------------------------------------------
// Copyright ?2002 Bushman Technologies (http://www.bushmantech.net)								-
// TERMS :	You may not remove above copyright statement. The rest of this message may be deleted.	-
//			You may not remove the link to Qyoteserver homepage in the generated statement without 	-
//			consent from Bushman Technologies.														-
// Quotes from : http://quoteserver.bushmantech.net													-
//---------------------------------------------------------------------------------------------------
// Author(s): Richard de Breyn						-
//---------------------------------------------------
// INCLUDED : 31 quotes.							-
// USAGE 	: Include this file into HTML document.	-
//			  In HTML document, include the line:	-
//				<script>putQ();</script>			-
// UPDATES 	: http://www.bushmantech.net			-
//---------------------------------------------------
var qArr = new Array();
// Add quotes here.
qArr[00] = ["&nbsp;", "&#147;Preemptive monitoring    , Life cycle focus of data    , Pursuing high performance and availability    , 24 X 7 X 365 continuous and for ever&#148;"];
qArr[01] = ["&nbsp;", "&#147;Meticulous maintenance service    , Profound understanding of IT systems    , Advanced service model and interaction     , Explore the core value of data&#148;"];
qArr[02] = ["&nbsp;", "&#147;Data rescue and trouble shooting    , DBA outsorcing    , Solution deployment    , Consulting and training&#148;"];
qArr[03] = ["&nbsp;", "&#147;Leading relational database vendor    , Growing storage solution provider     , No.1 application / database management    , Strict inspection quarantine&#148;"];
qArr[04] = ["&nbsp;", "&#147;Prompt Response     , Solution-based consulting    , Responsible veterans    , Aim at improving customers satisfaction&#148;"];
qUsed = new Array();

function PSputQ(){
	x=gUQ();
	document.open();
 	document.write(qArr[x][1]+"<BR><br>"+qArr[x][0]+" ");
	document.close();
}

function gUQ(){
	z=false;x=0;
	for(var i=0;i<1;){x=Math.floor(Math.random()*(qArr.length));if(checkIt(x)) i = 1;}
	qUsed[qUsed.length] = x;return x;
}

function checkIt(val){
	for(i=0;i<qUsed.length;i++){if(qUsed[i]==val){return false;}}
	return true;
}